{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KOEMEJUAFK6GIITD2T6VNTHDTD","short_pith_number":"pith:KOEMEJUA","schema_version":"1.0","canonical_sha256":"5388c226802abc642263d4fd56cce398f55d36b0f2db398979790a0f2275d057","source":{"kind":"arxiv","id":"1511.02423","version":3},"attestation_state":"computed","paper":{"title":"Globally solving Non-Convex Quadratic Programs via Linear Integer Programming techniques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Juan Vera, Luis F. Zuluaga, Wei Xia","submitted_at":"2015-11-08T01:17:37Z","abstract_excerpt":"Quadratic programming (QP) is a well-studied fundamental NP-hard optimization problem which optimizes a quadratic objective over a set of linear constraints. In this paper, we reformulate QPs as a mixed-integer linear problem (MILP). This is done via the reformulation of QP as a linear complementary problem, and the use of binary variables and big-M constraints, to model the complementary constraints. To obtain such reformulation, we show how to impose bounds on the dual variables without eliminating all the (globally) optimal primal solutions; using some fundamental results on the solution of"},"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":"1511.02423","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-08T01:17:37Z","cross_cats_sorted":[],"title_canon_sha256":"b57b865e4aaea7e912f952c97f33094352bafe24165b5578065d1f3d2d8cbc82","abstract_canon_sha256":"bfa273e91e6eeb711f70346e2ec6dae72415417b8377a8c0f8ddf5a00186d6a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:48.266456Z","signature_b64":"oLOkIclxe3CJZiNME7sQ6U/GUg6haNabVhkY0iQYsvfKrjUeKbPWDRI5n3XsYkIyrSXIZWfk/sHlsjNJqPmGCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5388c226802abc642263d4fd56cce398f55d36b0f2db398979790a0f2275d057","last_reissued_at":"2026-05-18T00:10:48.265798Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:48.265798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Globally solving Non-Convex Quadratic Programs via Linear Integer Programming techniques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Juan Vera, Luis F. Zuluaga, Wei Xia","submitted_at":"2015-11-08T01:17:37Z","abstract_excerpt":"Quadratic programming (QP) is a well-studied fundamental NP-hard optimization problem which optimizes a quadratic objective over a set of linear constraints. In this paper, we reformulate QPs as a mixed-integer linear problem (MILP). This is done via the reformulation of QP as a linear complementary problem, and the use of binary variables and big-M constraints, to model the complementary constraints. To obtain such reformulation, we show how to impose bounds on the dual variables without eliminating all the (globally) optimal primal solutions; using some fundamental results on the solution of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02423","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":""},"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":"1511.02423","created_at":"2026-05-18T00:10:48.265905+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.02423v3","created_at":"2026-05-18T00:10:48.265905+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02423","created_at":"2026-05-18T00:10:48.265905+00:00"},{"alias_kind":"pith_short_12","alias_value":"KOEMEJUAFK6G","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"KOEMEJUAFK6GIITD","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"KOEMEJUA","created_at":"2026-05-18T12:29:29.992203+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.02368","citing_title":"Simulated annealing with hit-and-run for convex optimization: rigorous complexity analysis and practical perspectives for copositive programming","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KOEMEJUAFK6GIITD2T6VNTHDTD","json":"https://pith.science/pith/KOEMEJUAFK6GIITD2T6VNTHDTD.json","graph_json":"https://pith.science/api/pith-number/KOEMEJUAFK6GIITD2T6VNTHDTD/graph.json","events_json":"https://pith.science/api/pith-number/KOEMEJUAFK6GIITD2T6VNTHDTD/events.json","paper":"https://pith.science/paper/KOEMEJUA"},"agent_actions":{"view_html":"https://pith.science/pith/KOEMEJUAFK6GIITD2T6VNTHDTD","download_json":"https://pith.science/pith/KOEMEJUAFK6GIITD2T6VNTHDTD.json","view_paper":"https://pith.science/paper/KOEMEJUA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.02423&json=true","fetch_graph":"https://pith.science/api/pith-number/KOEMEJUAFK6GIITD2T6VNTHDTD/graph.json","fetch_events":"https://pith.science/api/pith-number/KOEMEJUAFK6GIITD2T6VNTHDTD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KOEMEJUAFK6GIITD2T6VNTHDTD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KOEMEJUAFK6GIITD2T6VNTHDTD/action/storage_attestation","attest_author":"https://pith.science/pith/KOEMEJUAFK6GIITD2T6VNTHDTD/action/author_attestation","sign_citation":"https://pith.science/pith/KOEMEJUAFK6GIITD2T6VNTHDTD/action/citation_signature","submit_replication":"https://pith.science/pith/KOEMEJUAFK6GIITD2T6VNTHDTD/action/replication_record"}},"created_at":"2026-05-18T00:10:48.265905+00:00","updated_at":"2026-05-18T00:10:48.265905+00:00"}