{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:EU3TBWUJPCLSX4FEBIKZSVG52D","short_pith_number":"pith:EU3TBWUJ","schema_version":"1.0","canonical_sha256":"253730da8978972bf0a40a159954ddd0d2adbd1208c93cd966e694ee10514229","source":{"kind":"arxiv","id":"2103.13108","version":3},"attestation_state":"computed","paper":{"title":"QPPAL: A two-phase proximal augmented Lagrangian method for high dimensional convex quadratic programming problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Defeng Sun, Kim-Chuan Toh, Ling Liang, Xudong Li","submitted_at":"2021-03-24T11:30:36Z","abstract_excerpt":"In this paper, we aim to solve high dimensional convex quadratic programming (QP) problems with a large number of quadratic terms, linear equality and inequality constraints. In order to solve the targeted {\\bf QP} problems to a desired accuracy efficiently, we develop a two-phase {\\bf P}roximal {\\bf A}ugmented {\\bf L}agrangian method {(QPPAL)}, with Phase I to generate a reasonably good initial point to warm start Phase II to obtain an accurate solution efficiently. More specifically, in Phase I, based on the recently developed symmetric Gauss-Seidel (sGS) decomposition technique, we design a"},"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":"2103.13108","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-03-24T11:30:36Z","cross_cats_sorted":[],"title_canon_sha256":"1a68f2d04be364011b05ef1b7c022012525ed7ee224f1dcab46cae92acc1dac7","abstract_canon_sha256":"f5141e33ce99a58e3d470734f8b6c2c7a2890d15c82b22b0e379063553862397"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:52:12.374874Z","signature_b64":"XSER2itpXGUR995B+k8hUqXIn1+aE/sr2sHKl6vXVl1Vp+J8LO59gYdVFk4J5Cot4Lrym6NeQB5OUFDM8nl0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"253730da8978972bf0a40a159954ddd0d2adbd1208c93cd966e694ee10514229","last_reissued_at":"2026-07-05T03:52:12.374415Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:52:12.374415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"QPPAL: A two-phase proximal augmented Lagrangian method for high dimensional convex quadratic programming problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Defeng Sun, Kim-Chuan Toh, Ling Liang, Xudong Li","submitted_at":"2021-03-24T11:30:36Z","abstract_excerpt":"In this paper, we aim to solve high dimensional convex quadratic programming (QP) problems with a large number of quadratic terms, linear equality and inequality constraints. In order to solve the targeted {\\bf QP} problems to a desired accuracy efficiently, we develop a two-phase {\\bf P}roximal {\\bf A}ugmented {\\bf L}agrangian method {(QPPAL)}, with Phase I to generate a reasonably good initial point to warm start Phase II to obtain an accurate solution efficiently. More specifically, in Phase I, based on the recently developed symmetric Gauss-Seidel (sGS) decomposition technique, we design a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.13108","kind":"arxiv","version":3},"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/2103.13108/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":"2103.13108","created_at":"2026-07-05T03:52:12.374458+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.13108v3","created_at":"2026-07-05T03:52:12.374458+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.13108","created_at":"2026-07-05T03:52:12.374458+00:00"},{"alias_kind":"pith_short_12","alias_value":"EU3TBWUJPCLS","created_at":"2026-07-05T03:52:12.374458+00:00"},{"alias_kind":"pith_short_16","alias_value":"EU3TBWUJPCLSX4FE","created_at":"2026-07-05T03:52:12.374458+00:00"},{"alias_kind":"pith_short_8","alias_value":"EU3TBWUJ","created_at":"2026-07-05T03:52:12.374458+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EU3TBWUJPCLSX4FEBIKZSVG52D","json":"https://pith.science/pith/EU3TBWUJPCLSX4FEBIKZSVG52D.json","graph_json":"https://pith.science/api/pith-number/EU3TBWUJPCLSX4FEBIKZSVG52D/graph.json","events_json":"https://pith.science/api/pith-number/EU3TBWUJPCLSX4FEBIKZSVG52D/events.json","paper":"https://pith.science/paper/EU3TBWUJ"},"agent_actions":{"view_html":"https://pith.science/pith/EU3TBWUJPCLSX4FEBIKZSVG52D","download_json":"https://pith.science/pith/EU3TBWUJPCLSX4FEBIKZSVG52D.json","view_paper":"https://pith.science/paper/EU3TBWUJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.13108&json=true","fetch_graph":"https://pith.science/api/pith-number/EU3TBWUJPCLSX4FEBIKZSVG52D/graph.json","fetch_events":"https://pith.science/api/pith-number/EU3TBWUJPCLSX4FEBIKZSVG52D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EU3TBWUJPCLSX4FEBIKZSVG52D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EU3TBWUJPCLSX4FEBIKZSVG52D/action/storage_attestation","attest_author":"https://pith.science/pith/EU3TBWUJPCLSX4FEBIKZSVG52D/action/author_attestation","sign_citation":"https://pith.science/pith/EU3TBWUJPCLSX4FEBIKZSVG52D/action/citation_signature","submit_replication":"https://pith.science/pith/EU3TBWUJPCLSX4FEBIKZSVG52D/action/replication_record"}},"created_at":"2026-07-05T03:52:12.374458+00:00","updated_at":"2026-07-05T03:52:12.374458+00:00"}