{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:74J3FFDGUEUYGVOEYINJMMHSDF","short_pith_number":"pith:74J3FFDG","schema_version":"1.0","canonical_sha256":"ff13b29466a1298355c4c21a9630f2195d15717102a609f1939a70a0d77e844a","source":{"kind":"arxiv","id":"2507.02470","version":1},"attestation_state":"computed","paper":{"title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Defeng Sun, Guojun Zhang, Kaihuang Chen, Xinyuan Zhao, Yancheng Yuan","submitted_at":"2025-07-03T09:28:29Z","abstract_excerpt":"In this paper, we introduce HPR-QP, a dual Halpern Peaceman-Rachford (HPR) method designed for solving large-scale convex composite quadratic programming. One distinctive feature of HPR-QP is that, instead of working with the primal formulations, it builds on the novel restricted Wolfe dual introduced in recent years. It also leverages the symmetric Gauss-Seidel technique to simplify subproblem updates without introducing auxiliary slack variables that typically lead to slow convergence. By restricting updates to the range space of the Hessian of the quadratic objective function, HPR-QP employ"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2507.02470","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-07-03T09:28:29Z","cross_cats_sorted":[],"title_canon_sha256":"64cde61c70d9840d2209f1f473d76531f8ff51a3f265009a6bc8d6546603c166","abstract_canon_sha256":"d6942c8165459da3a0a376967769a145547b769fc34d97657209885214aa6290"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:31:18.859506Z","signature_b64":"AYv/1i1BtDcXOItJbyI/Lwr1qqkB5XVGN9VsdI6tou/aOyStuCB5+cGH9K52352yufDFSSNpuGHcE3PcMw+ECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff13b29466a1298355c4c21a9630f2195d15717102a609f1939a70a0d77e844a","last_reissued_at":"2026-07-05T11:31:18.859105Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:31:18.859105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Defeng Sun, Guojun Zhang, Kaihuang Chen, Xinyuan Zhao, Yancheng Yuan","submitted_at":"2025-07-03T09:28:29Z","abstract_excerpt":"In this paper, we introduce HPR-QP, a dual Halpern Peaceman-Rachford (HPR) method designed for solving large-scale convex composite quadratic programming. One distinctive feature of HPR-QP is that, instead of working with the primal formulations, it builds on the novel restricted Wolfe dual introduced in recent years. It also leverages the symmetric Gauss-Seidel technique to simplify subproblem updates without introducing auxiliary slack variables that typically lead to slow convergence. By restricting updates to the range space of the Hessian of the quadratic objective function, HPR-QP employ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.02470","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.02470/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2507.02470","created_at":"2026-07-05T11:31:18.859161+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.02470v1","created_at":"2026-07-05T11:31:18.859161+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.02470","created_at":"2026-07-05T11:31:18.859161+00:00"},{"alias_kind":"pith_short_12","alias_value":"74J3FFDGUEUY","created_at":"2026-07-05T11:31:18.859161+00:00"},{"alias_kind":"pith_short_16","alias_value":"74J3FFDGUEUYGVOE","created_at":"2026-07-05T11:31:18.859161+00:00"},{"alias_kind":"pith_short_8","alias_value":"74J3FFDG","created_at":"2026-07-05T11:31:18.859161+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.07585","citing_title":"Convergence Analysis of the Restarted Moving-Anchored Extra-Gradient Method in the Absence of Local Lipschitz Continuity","ref_index":9,"is_internal_anchor":true},{"citing_arxiv_id":"2605.29291","citing_title":"Restarted Accelerated Primal-Dual Algorithms with Adaptive Stepsizes for Nonlinear Conic Constrained Convex Optimization","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2605.17883","citing_title":"On the convergence of doubly stochastic Primal-Dual Hybrid Gradient Method","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11526","citing_title":"Efficient and provably convergent end-to-end training of deep neural networks with linear constraints","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/74J3FFDGUEUYGVOEYINJMMHSDF","json":"https://pith.science/pith/74J3FFDGUEUYGVOEYINJMMHSDF.json","graph_json":"https://pith.science/api/pith-number/74J3FFDGUEUYGVOEYINJMMHSDF/graph.json","events_json":"https://pith.science/api/pith-number/74J3FFDGUEUYGVOEYINJMMHSDF/events.json","paper":"https://pith.science/paper/74J3FFDG"},"agent_actions":{"view_html":"https://pith.science/pith/74J3FFDGUEUYGVOEYINJMMHSDF","download_json":"https://pith.science/pith/74J3FFDGUEUYGVOEYINJMMHSDF.json","view_paper":"https://pith.science/paper/74J3FFDG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.02470&json=true","fetch_graph":"https://pith.science/api/pith-number/74J3FFDGUEUYGVOEYINJMMHSDF/graph.json","fetch_events":"https://pith.science/api/pith-number/74J3FFDGUEUYGVOEYINJMMHSDF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/74J3FFDGUEUYGVOEYINJMMHSDF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/74J3FFDGUEUYGVOEYINJMMHSDF/action/storage_attestation","attest_author":"https://pith.science/pith/74J3FFDGUEUYGVOEYINJMMHSDF/action/author_attestation","sign_citation":"https://pith.science/pith/74J3FFDGUEUYGVOEYINJMMHSDF/action/citation_signature","submit_replication":"https://pith.science/pith/74J3FFDGUEUYGVOEYINJMMHSDF/action/replication_record"}},"created_at":"2026-07-05T11:31:18.859161+00:00","updated_at":"2026-07-05T11:31:18.859161+00:00"}