{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OZCPMK4PU2QDIJTZA2JUDKBT2D","short_pith_number":"pith:OZCPMK4P","schema_version":"1.0","canonical_sha256":"7644f62b8fa6a0342679069341a833d0e060085a771bd754bd8f6dcf24ed2459","source":{"kind":"arxiv","id":"1810.02307","version":1},"attestation_state":"computed","paper":{"title":"Global Solutions of Nonconvex Standard Quadratic Programs via Mixed Integer Linear Programming Reformulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"E. Alper Yildirim, Jacek Gondzio","submitted_at":"2018-10-04T16:42:46Z","abstract_excerpt":"A standard quadratic program is an optimization problem that consists of minimizing a (nonconvex) quadratic form over the unit simplex. We focus on reformulating a standard quadratic program as a mixed integer linear programming problem. We propose two alternative mixed integer linear programming formulations. Our first formulation is based on casting a standard quadratic program as a linear program with complementarity constraints. We then employ binary variables to linearize the complementarity constraints. For the second formulation, we first derive an overestimating function of the objecti"},"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":"1810.02307","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-04T16:42:46Z","cross_cats_sorted":[],"title_canon_sha256":"9398d86eaad203a0d2a87855df46d2afa5b9128f40222defa0b61043874d79c4","abstract_canon_sha256":"13b5f9128c69fc5d27490081a9c43bcf6a6bd7b334fb8439f55b705791ba3623"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:05.657328Z","signature_b64":"Dmw49DSrmChR1tT7gl0iqASsUlEARNTOZbuPIDM5jNuF0ISWHgrMm8X/Q7aufouIJSVzjnsNCGXBL4ZeEz7CDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7644f62b8fa6a0342679069341a833d0e060085a771bd754bd8f6dcf24ed2459","last_reissued_at":"2026-05-18T00:04:05.656655Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:05.656655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Global Solutions of Nonconvex Standard Quadratic Programs via Mixed Integer Linear Programming Reformulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"E. Alper Yildirim, Jacek Gondzio","submitted_at":"2018-10-04T16:42:46Z","abstract_excerpt":"A standard quadratic program is an optimization problem that consists of minimizing a (nonconvex) quadratic form over the unit simplex. We focus on reformulating a standard quadratic program as a mixed integer linear programming problem. We propose two alternative mixed integer linear programming formulations. Our first formulation is based on casting a standard quadratic program as a linear program with complementarity constraints. We then employ binary variables to linearize the complementarity constraints. For the second formulation, we first derive an overestimating function of the objecti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02307","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":"1810.02307","created_at":"2026-05-18T00:04:05.656761+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.02307v1","created_at":"2026-05-18T00:04:05.656761+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02307","created_at":"2026-05-18T00:04:05.656761+00:00"},{"alias_kind":"pith_short_12","alias_value":"OZCPMK4PU2QD","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OZCPMK4PU2QDIJTZ","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OZCPMK4P","created_at":"2026-05-18T12:32:43.782077+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/OZCPMK4PU2QDIJTZA2JUDKBT2D","json":"https://pith.science/pith/OZCPMK4PU2QDIJTZA2JUDKBT2D.json","graph_json":"https://pith.science/api/pith-number/OZCPMK4PU2QDIJTZA2JUDKBT2D/graph.json","events_json":"https://pith.science/api/pith-number/OZCPMK4PU2QDIJTZA2JUDKBT2D/events.json","paper":"https://pith.science/paper/OZCPMK4P"},"agent_actions":{"view_html":"https://pith.science/pith/OZCPMK4PU2QDIJTZA2JUDKBT2D","download_json":"https://pith.science/pith/OZCPMK4PU2QDIJTZA2JUDKBT2D.json","view_paper":"https://pith.science/paper/OZCPMK4P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.02307&json=true","fetch_graph":"https://pith.science/api/pith-number/OZCPMK4PU2QDIJTZA2JUDKBT2D/graph.json","fetch_events":"https://pith.science/api/pith-number/OZCPMK4PU2QDIJTZA2JUDKBT2D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OZCPMK4PU2QDIJTZA2JUDKBT2D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OZCPMK4PU2QDIJTZA2JUDKBT2D/action/storage_attestation","attest_author":"https://pith.science/pith/OZCPMK4PU2QDIJTZA2JUDKBT2D/action/author_attestation","sign_citation":"https://pith.science/pith/OZCPMK4PU2QDIJTZA2JUDKBT2D/action/citation_signature","submit_replication":"https://pith.science/pith/OZCPMK4PU2QDIJTZA2JUDKBT2D/action/replication_record"}},"created_at":"2026-05-18T00:04:05.656761+00:00","updated_at":"2026-05-18T00:04:05.656761+00:00"}