{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:IEMIPVVS2BRIPMHFJXPDKHANNZ","short_pith_number":"pith:IEMIPVVS","schema_version":"1.0","canonical_sha256":"411887d6b2d06287b0e54dde351c0d6e5f045e1dc7b62515b97a50c18deb509d","source":{"kind":"arxiv","id":"1409.5222","version":1},"attestation_state":"computed","paper":{"title":"Algorithms for Convex Quadratic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Philipp Hungerl\\\"ander","submitted_at":"2014-09-18T08:18:24Z","abstract_excerpt":"The main contribution of this thesis is the development of a new algorithm for solving convex quadratic programs. It consists in combining the method of multipliers with an infeasible active-set method. Our approach is iterative. In each step we calculate an augmented Lagrange function. Then we minimize this function using an infeasible active-set method that was already successfully applied to similar problems. After this we update the Lagrange multiplier for the equality constraints. Finally we try to solve convex quadratic program directly, again with the infeasible active-set method, start"},"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":"1409.5222","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-18T08:18:24Z","cross_cats_sorted":[],"title_canon_sha256":"852a1d7fc4d4345934350457accd274a2c1d09e47fbc1114297bbc7e81b3bf9d","abstract_canon_sha256":"12f94f3c676b99387b9c5a49dcb9a8616a04dc1c7dfa350ad9de1f76c2caee41"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:30.403753Z","signature_b64":"vqzUXZQOdMbQHRqWuYwK99JD68EQr8WCccMcj0eFW3kspyNa+6fun9qq+y9VhfXPN9VAuHWm5A5JgPlQMULxDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"411887d6b2d06287b0e54dde351c0d6e5f045e1dc7b62515b97a50c18deb509d","last_reissued_at":"2026-05-18T02:42:30.402867Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:30.402867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms for Convex Quadratic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Philipp Hungerl\\\"ander","submitted_at":"2014-09-18T08:18:24Z","abstract_excerpt":"The main contribution of this thesis is the development of a new algorithm for solving convex quadratic programs. It consists in combining the method of multipliers with an infeasible active-set method. Our approach is iterative. In each step we calculate an augmented Lagrange function. Then we minimize this function using an infeasible active-set method that was already successfully applied to similar problems. After this we update the Lagrange multiplier for the equality constraints. Finally we try to solve convex quadratic program directly, again with the infeasible active-set method, start"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.5222","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":""},"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":"1409.5222","created_at":"2026-05-18T02:42:30.403013+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.5222v1","created_at":"2026-05-18T02:42:30.403013+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.5222","created_at":"2026-05-18T02:42:30.403013+00:00"},{"alias_kind":"pith_short_12","alias_value":"IEMIPVVS2BRI","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"IEMIPVVS2BRIPMHF","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"IEMIPVVS","created_at":"2026-05-18T12:28:33.132498+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/IEMIPVVS2BRIPMHFJXPDKHANNZ","json":"https://pith.science/pith/IEMIPVVS2BRIPMHFJXPDKHANNZ.json","graph_json":"https://pith.science/api/pith-number/IEMIPVVS2BRIPMHFJXPDKHANNZ/graph.json","events_json":"https://pith.science/api/pith-number/IEMIPVVS2BRIPMHFJXPDKHANNZ/events.json","paper":"https://pith.science/paper/IEMIPVVS"},"agent_actions":{"view_html":"https://pith.science/pith/IEMIPVVS2BRIPMHFJXPDKHANNZ","download_json":"https://pith.science/pith/IEMIPVVS2BRIPMHFJXPDKHANNZ.json","view_paper":"https://pith.science/paper/IEMIPVVS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.5222&json=true","fetch_graph":"https://pith.science/api/pith-number/IEMIPVVS2BRIPMHFJXPDKHANNZ/graph.json","fetch_events":"https://pith.science/api/pith-number/IEMIPVVS2BRIPMHFJXPDKHANNZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IEMIPVVS2BRIPMHFJXPDKHANNZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IEMIPVVS2BRIPMHFJXPDKHANNZ/action/storage_attestation","attest_author":"https://pith.science/pith/IEMIPVVS2BRIPMHFJXPDKHANNZ/action/author_attestation","sign_citation":"https://pith.science/pith/IEMIPVVS2BRIPMHFJXPDKHANNZ/action/citation_signature","submit_replication":"https://pith.science/pith/IEMIPVVS2BRIPMHFJXPDKHANNZ/action/replication_record"}},"created_at":"2026-05-18T02:42:30.403013+00:00","updated_at":"2026-05-18T02:42:30.403013+00:00"}