{"paper":{"title":"Accelerated Transformed Primal Dual Methods for Smooth Convex Optimization Problems with Affine Equality Constraints","arxiv_id":"2611.17026","primary_cat":"math.OC","submitted_at":"2026-11-12T16:14:22+00:00","version_compiled":"v1"},"notice":"Every quoted sentence is the authors' text from the arXiv listing abstract. Labels and probabilities are the outputs of classifier-1.13.0 on the question bank abstract-p1-20260923, exactly as returned. No sentence in this record was written by a language model.","schema":"pith.compiled-record/v0","status":"compiled","abstract":{"source":"arXiv listing abstract v1","sentences":[{"i":0,"p":0.99,"id":"s0","own":true,"role":"contribution","text":"Accelerated transformed primal--dual (ATPD) methods are proposed for smooth convex optimization problems with affine equality constraints.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.92,"main_claim_p":0.35,"quantitative":false,"quantitative_p":0.03,"role_probabilities":{"gap":0.0,"method":0.01,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.99,"interpretation":0.0}},{"i":1,"p":0.87,"id":"s1","own":true,"role":"method","text":"The methods combine primal--dual dynamics with a transformation designed to accelerate convergence.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.8,"main_claim_p":0.1,"quantitative":false,"quantitative_p":0.03,"role_probabilities":{"gap":0.0,"method":0.87,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.13,"interpretation":0.0}},{"i":2,"p":1.0,"id":"s2","own":true,"role":"result","text":"In the strongly convex case, ATPD achieves an accelerated linear convergence rate and matches the known lower bounds on first-order oracle complexity in terms of gradient evaluations and matrix--vector products.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.92,"main_claim_p":0.47,"quantitative":true,"quantitative_p":0.89,"role_probabilities":{"gap":0.0,"method":0.0,"result":1.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":3,"p":0.59,"id":"s3","own":true,"role":"method","text":"The analysis distinguishes these two types of computational work when assessing the complexity of the method.","hedge":{"p":0.98,"label":"asserted"},"own_p":0.81,"main_claim_p":0.04,"quantitative":false,"quantitative_p":0.06,"role_probabilities":{"gap":0.0,"method":0.59,"result":0.05,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.33,"interpretation":0.03}},{"i":4,"p":0.7,"id":"s4","own":true,"role":"contribution","text":"For general convex objectives, a homotopy perturbation strategy is introduced, and an accelerated sublinear rate for the modified Lyapunov energy is proved under a uniform boundedness condition on the primal iterates at all homotopy stages.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.94,"main_claim_p":0.16,"quantitative":false,"quantitative_p":0.47,"role_probabilities":{"gap":0.0,"method":0.06,"result":0.24,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.7,"interpretation":0.0}},{"i":5,"p":0.96,"id":"s5","own":true,"role":"method","text":"The acceleration mechanism is based on an exponentially stable ATPD flow and a modified discrete Lyapunov function.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.82,"main_claim_p":0.08,"quantitative":false,"quantitative_p":0.05,"role_probabilities":{"gap":0.0,"method":0.96,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.04,"interpretation":0.0}},{"i":6,"p":0.92,"id":"s6","own":true,"role":"method","text":"This continuous-time perspective guides the construction and analysis of the discrete methods.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.73,"main_claim_p":0.04,"quantitative":false,"quantitative_p":0.03,"role_probabilities":{"gap":0.0,"method":0.92,"result":0.0,"background":0.01,"limitation":0.0,"future_work":0.0,"contribution":0.03,"interpretation":0.04}},{"i":7,"p":0.73,"id":"s7","own":true,"role":"result","text":"Numerical experiments on policy evaluation and constrained signal reconstruction problems support the theory and illustrate the efficiency of the proposed methods.","hedge":{"p":0.99,"label":"asserted"},"own_p":0.95,"main_claim_p":0.14,"quantitative":false,"quantitative_p":0.06,"role_probabilities":{"gap":0.0,"method":0.15,"result":0.73,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.11,"interpretation":0.01}}]},"compiled":{"main_claim":{"p":0.78,"text":"In the strongly convex case, ATPD achieves an accelerated linear convergence rate and matches the known lower bounds on first-order oracle complexity in terms of gradient evaluations and matrix--vector products.","location":"abstract s2","hedge_strength":{"p":1.0,"label":"asserted"}},"provenance":{"route":{"via":"TypeSafe API","model":"classifier-1.13.0","endpoint":"https://api.typesafe.ai/v1/systemone","provider":"TypeSafe"},"packing":"one request per paper","requests":1,"input_tokens":6151,"cost_usd_reported":0.0},"compiled_at":"2026-11-13","bank_version":"abstract-p1-20260923","model_version":"classifier-1.13.0","abstract_states":{"claims_first":0.04,"states_limitation":0.68,"human_participants":0.02,"controlled_comparison":0.05,"randomized_assignment":0.01,"states_quantitative_result":0.49,"compares_with_prior_results":0.64,"mentions_code_or_data_availability":0.02},"evidential_basis":{"p":1.0,"value":"proof or derivation","probabilities":{"argument":0.0,"literature":0.0,"proof_or_derivation":1.0,"analysis_of_existing_data":0.0,"observation_or_experiment":0.0,"simulation_or_computation":0.0}},"contribution_type":{"p":1.0,"value":"method or tool","probabilities":{"review":0.0,"method_or_tool":1.0,"empirical_study":0.0,"simulation_study":0.0,"theoretical_result":0.0,"dataset_or_benchmark":0.0,"position_or_commentary":0.0}},"contribution_statement":{"p":0.94,"text":"Accelerated transformed primal--dual (ATPD) methods are proposed for smooth convex optimization problems with affine equality constraints.","location":"abstract s0"}},"coverage":{"tier":"abstract","levels_run":["P abstract"],"not_examined":["full text","figures and tables","references and citing sentences","relations to other papers"],"sources_read":["arXiv listing abstract v1"],"levels_not_run":["S sections","T body sentences","C citations","R cross-paper relations"],"sentences_examined":8,"sentences_in_abstract":8},"measured_accuracy":{"url":"https://pith.science/accuracy","measured_on":"2026-10-02","method":"two independent model families labelled a fresh random sample blind; the figure is how often the published label matches their consensus","sentence_role_agreement":0.92,"main_claim_agreement":0.908,"typed_citation_agreement":0.933,"typed_citation_agreement_95_interval":[0.917,0.945],"review_comments_accurate":0.758,"review_comments_accurate_95_interval":[0.684,0.82],"review_caught_admitted_error_found_or_related":0.448,"review_comments_judged":{"judged_by":["gpt-5.6-luna","grok-4.7"],"judged_against":"Pith's own text copy of each paper: text extracted from the PDF, the first 90,000 characters","measured_on":"2026-10-04","accurate":113,"decided":149,"sampled_reviews":200,"split_by_lane":false,"by_lane":"https://pith.science/accuracy#by-lane"}}}