{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2JC23MZBDXRENYKDFCV4LDNNFN","short_pith_number":"pith:2JC23MZB","schema_version":"1.0","canonical_sha256":"d245adb3211de246e14328abc58dad2b43828b28a11d67f7a866ec31462561f7","source":{"kind":"arxiv","id":"1503.08349","version":2},"attestation_state":"computed","paper":{"title":"Primal and dual active-set methods for convex quadratic programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anders Forsgren, Elizabeth Wong, Philip E. Gill","submitted_at":"2015-03-28T21:04:20Z","abstract_excerpt":"Computational methods are proposed for solving a convex quadratic program (QP). Active-set methods are defined for a particular primal and dual formulation of a QP with general equality constraints and simple lower bounds on the variables. In the first part of the paper, two methods are proposed, one primal and one dual. These methods generate a sequence of iterates that are feasible with respect to the equality constraints associated with the optimality conditions of the primal-dual form. The primal method maintains feasibility of the primal inequalities while driving the infeasibilities of t"},"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":"1503.08349","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-28T21:04:20Z","cross_cats_sorted":[],"title_canon_sha256":"c779d898a9d90d10edd1e0dc4d260ba5997ac60fc57ebf7a4ce15ce17b62bfd3","abstract_canon_sha256":"e32b8689905dd7720adbb768e9423cb8aafd06735f87bde59f68440d96f77cec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:42.221033Z","signature_b64":"k3IKLDAnOvDxS5uEaEPUy/h34ocYM3N2hWZhZcR4i2ejBfPejKP5O708NzpD/oJjQCLU2L0AsJiwkAgMrJhACQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d245adb3211de246e14328abc58dad2b43828b28a11d67f7a866ec31462561f7","last_reissued_at":"2026-05-18T00:04:42.220442Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:42.220442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Primal and dual active-set methods for convex quadratic programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anders Forsgren, Elizabeth Wong, Philip E. Gill","submitted_at":"2015-03-28T21:04:20Z","abstract_excerpt":"Computational methods are proposed for solving a convex quadratic program (QP). Active-set methods are defined for a particular primal and dual formulation of a QP with general equality constraints and simple lower bounds on the variables. In the first part of the paper, two methods are proposed, one primal and one dual. These methods generate a sequence of iterates that are feasible with respect to the equality constraints associated with the optimality conditions of the primal-dual form. The primal method maintains feasibility of the primal inequalities while driving the infeasibilities of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08349","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1503.08349","created_at":"2026-05-18T00:04:42.220535+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.08349v2","created_at":"2026-05-18T00:04:42.220535+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08349","created_at":"2026-05-18T00:04:42.220535+00:00"},{"alias_kind":"pith_short_12","alias_value":"2JC23MZBDXRE","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"2JC23MZBDXRENYKD","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"2JC23MZB","created_at":"2026-05-18T12:28:59.999130+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/2JC23MZBDXRENYKDFCV4LDNNFN","json":"https://pith.science/pith/2JC23MZBDXRENYKDFCV4LDNNFN.json","graph_json":"https://pith.science/api/pith-number/2JC23MZBDXRENYKDFCV4LDNNFN/graph.json","events_json":"https://pith.science/api/pith-number/2JC23MZBDXRENYKDFCV4LDNNFN/events.json","paper":"https://pith.science/paper/2JC23MZB"},"agent_actions":{"view_html":"https://pith.science/pith/2JC23MZBDXRENYKDFCV4LDNNFN","download_json":"https://pith.science/pith/2JC23MZBDXRENYKDFCV4LDNNFN.json","view_paper":"https://pith.science/paper/2JC23MZB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.08349&json=true","fetch_graph":"https://pith.science/api/pith-number/2JC23MZBDXRENYKDFCV4LDNNFN/graph.json","fetch_events":"https://pith.science/api/pith-number/2JC23MZBDXRENYKDFCV4LDNNFN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2JC23MZBDXRENYKDFCV4LDNNFN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2JC23MZBDXRENYKDFCV4LDNNFN/action/storage_attestation","attest_author":"https://pith.science/pith/2JC23MZBDXRENYKDFCV4LDNNFN/action/author_attestation","sign_citation":"https://pith.science/pith/2JC23MZBDXRENYKDFCV4LDNNFN/action/citation_signature","submit_replication":"https://pith.science/pith/2JC23MZBDXRENYKDFCV4LDNNFN/action/replication_record"}},"created_at":"2026-05-18T00:04:42.220535+00:00","updated_at":"2026-05-18T00:04:42.220535+00:00"}