{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4WOIUEBX7LALAIQX4D5JQVLFUM","short_pith_number":"pith:4WOIUEBX","schema_version":"1.0","canonical_sha256":"e59c8a1037fac0b02217e0fa985565a3002b17dc0a073c4c5035036026949fb2","source":{"kind":"arxiv","id":"1907.02989","version":6},"attestation_state":"computed","paper":{"title":"An Optimality Gap Test for a Semidefinite Relaxation of a Quadratic Program with Two Quadratic Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Nuno C. Martins, Sheng Cheng","submitted_at":"2019-07-05T18:26:49Z","abstract_excerpt":"We propose a necessary and sufficient test to determine whether a solution for a general quadratic program with two quadratic constraints (QC2QP) can be computed from that of a specific convex semidefinite relaxation, in which case we say that there is no optimality gap. Originally intended to solve a nonconvex optimal control problem, we consider the case in which the cost and both constraints of the QC2QP may be nonconvex. We obtained our test, which also ascertains when strong duality holds, by generalizing a closely-related method by Ai and Zhang. An extension was necessary because, while "},"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":"1907.02989","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-05T18:26:49Z","cross_cats_sorted":[],"title_canon_sha256":"ade82212fa19cffbb740eab0930ac50fdce0fab18c1b51a925f8b55773d23da2","abstract_canon_sha256":"9dbb54798a57f854c36728ecfb1867287ebdc6746169dc6ab55fe03870c2e0cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:23:55.701854Z","signature_b64":"pePCv+fweJ7vzedc5YJjz0pPwsx7HrEexniMB9ZmyimVnBO+Sn8XJXyBzXmY/bTe2fqVb0jqSrr/TPTaZ6krCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e59c8a1037fac0b02217e0fa985565a3002b17dc0a073c4c5035036026949fb2","last_reissued_at":"2026-07-05T02:23:55.701305Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:23:55.701305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Optimality Gap Test for a Semidefinite Relaxation of a Quadratic Program with Two Quadratic Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Nuno C. Martins, Sheng Cheng","submitted_at":"2019-07-05T18:26:49Z","abstract_excerpt":"We propose a necessary and sufficient test to determine whether a solution for a general quadratic program with two quadratic constraints (QC2QP) can be computed from that of a specific convex semidefinite relaxation, in which case we say that there is no optimality gap. Originally intended to solve a nonconvex optimal control problem, we consider the case in which the cost and both constraints of the QC2QP may be nonconvex. We obtained our test, which also ascertains when strong duality holds, by generalizing a closely-related method by Ai and Zhang. An extension was necessary because, while "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02989","kind":"arxiv","version":6},"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/1907.02989/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":"1907.02989","created_at":"2026-07-05T02:23:55.701376+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.02989v6","created_at":"2026-07-05T02:23:55.701376+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02989","created_at":"2026-07-05T02:23:55.701376+00:00"},{"alias_kind":"pith_short_12","alias_value":"4WOIUEBX7LAL","created_at":"2026-07-05T02:23:55.701376+00:00"},{"alias_kind":"pith_short_16","alias_value":"4WOIUEBX7LALAIQX","created_at":"2026-07-05T02:23:55.701376+00:00"},{"alias_kind":"pith_short_8","alias_value":"4WOIUEBX","created_at":"2026-07-05T02:23:55.701376+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/4WOIUEBX7LALAIQX4D5JQVLFUM","json":"https://pith.science/pith/4WOIUEBX7LALAIQX4D5JQVLFUM.json","graph_json":"https://pith.science/api/pith-number/4WOIUEBX7LALAIQX4D5JQVLFUM/graph.json","events_json":"https://pith.science/api/pith-number/4WOIUEBX7LALAIQX4D5JQVLFUM/events.json","paper":"https://pith.science/paper/4WOIUEBX"},"agent_actions":{"view_html":"https://pith.science/pith/4WOIUEBX7LALAIQX4D5JQVLFUM","download_json":"https://pith.science/pith/4WOIUEBX7LALAIQX4D5JQVLFUM.json","view_paper":"https://pith.science/paper/4WOIUEBX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.02989&json=true","fetch_graph":"https://pith.science/api/pith-number/4WOIUEBX7LALAIQX4D5JQVLFUM/graph.json","fetch_events":"https://pith.science/api/pith-number/4WOIUEBX7LALAIQX4D5JQVLFUM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4WOIUEBX7LALAIQX4D5JQVLFUM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4WOIUEBX7LALAIQX4D5JQVLFUM/action/storage_attestation","attest_author":"https://pith.science/pith/4WOIUEBX7LALAIQX4D5JQVLFUM/action/author_attestation","sign_citation":"https://pith.science/pith/4WOIUEBX7LALAIQX4D5JQVLFUM/action/citation_signature","submit_replication":"https://pith.science/pith/4WOIUEBX7LALAIQX4D5JQVLFUM/action/replication_record"}},"created_at":"2026-07-05T02:23:55.701376+00:00","updated_at":"2026-07-05T02:23:55.701376+00:00"}