{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EEBSM6DOSRK4BTU4UVHXBK74OF","short_pith_number":"pith:EEBSM6DO","schema_version":"1.0","canonical_sha256":"210326786e9455c0ce9ca54f70abfc716d96cf71d9ab2e7ad73225a2279aaba4","source":{"kind":"arxiv","id":"1809.09814","version":1},"attestation_state":"computed","paper":{"title":"Convex Relaxation of Bilinear Matrix Inequalities Part I: Theoretical Results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Fariba Zohrizadeh, Mohsen Kheirandishfard, Ramtin Madani","submitted_at":"2018-09-26T05:27:31Z","abstract_excerpt":"This two-part paper is concerned with the problem of minimizing a linear objective function subject to a bilinear matrix inequality (BMI) constraint. In this part, we first consider a family of convex relaxations which transform BMI optimization problems into polynomial-time solvable surrogates. As an alternative to the state-of-the-art semidefinite programming (SDP) and second-order cone programming (SOCP) relaxations, a computationally efficient parabolic relaxation is developed, which relies on convex quadratic constraints only. Next, we developed a family of penalty functions, which can be"},"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":"1809.09814","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-26T05:27:31Z","cross_cats_sorted":[],"title_canon_sha256":"75e4d03a1f860a83952d6445db754be24dc4429f226914966f5079dbd5e2a401","abstract_canon_sha256":"dd063a592428bedde28b9d25eb2230770f56247838307a4daabce0f9332c63ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:43.578857Z","signature_b64":"JDQotY485l9f7U1CzSTQAtB4kj3TpiwxG8A3S8QC6iXANop3T4Jul+3XLQuYrVznXu/P9ZBZIOhupssTlFbMCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"210326786e9455c0ce9ca54f70abfc716d96cf71d9ab2e7ad73225a2279aaba4","last_reissued_at":"2026-05-18T00:04:43.578252Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:43.578252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convex Relaxation of Bilinear Matrix Inequalities Part I: Theoretical Results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Fariba Zohrizadeh, Mohsen Kheirandishfard, Ramtin Madani","submitted_at":"2018-09-26T05:27:31Z","abstract_excerpt":"This two-part paper is concerned with the problem of minimizing a linear objective function subject to a bilinear matrix inequality (BMI) constraint. In this part, we first consider a family of convex relaxations which transform BMI optimization problems into polynomial-time solvable surrogates. As an alternative to the state-of-the-art semidefinite programming (SDP) and second-order cone programming (SOCP) relaxations, a computationally efficient parabolic relaxation is developed, which relies on convex quadratic constraints only. Next, we developed a family of penalty functions, which can be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09814","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":"1809.09814","created_at":"2026-05-18T00:04:43.578357+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.09814v1","created_at":"2026-05-18T00:04:43.578357+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09814","created_at":"2026-05-18T00:04:43.578357+00:00"},{"alias_kind":"pith_short_12","alias_value":"EEBSM6DOSRK4","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EEBSM6DOSRK4BTU4","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EEBSM6DO","created_at":"2026-05-18T12:32:22.470017+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/EEBSM6DOSRK4BTU4UVHXBK74OF","json":"https://pith.science/pith/EEBSM6DOSRK4BTU4UVHXBK74OF.json","graph_json":"https://pith.science/api/pith-number/EEBSM6DOSRK4BTU4UVHXBK74OF/graph.json","events_json":"https://pith.science/api/pith-number/EEBSM6DOSRK4BTU4UVHXBK74OF/events.json","paper":"https://pith.science/paper/EEBSM6DO"},"agent_actions":{"view_html":"https://pith.science/pith/EEBSM6DOSRK4BTU4UVHXBK74OF","download_json":"https://pith.science/pith/EEBSM6DOSRK4BTU4UVHXBK74OF.json","view_paper":"https://pith.science/paper/EEBSM6DO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.09814&json=true","fetch_graph":"https://pith.science/api/pith-number/EEBSM6DOSRK4BTU4UVHXBK74OF/graph.json","fetch_events":"https://pith.science/api/pith-number/EEBSM6DOSRK4BTU4UVHXBK74OF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EEBSM6DOSRK4BTU4UVHXBK74OF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EEBSM6DOSRK4BTU4UVHXBK74OF/action/storage_attestation","attest_author":"https://pith.science/pith/EEBSM6DOSRK4BTU4UVHXBK74OF/action/author_attestation","sign_citation":"https://pith.science/pith/EEBSM6DOSRK4BTU4UVHXBK74OF/action/citation_signature","submit_replication":"https://pith.science/pith/EEBSM6DOSRK4BTU4UVHXBK74OF/action/replication_record"}},"created_at":"2026-05-18T00:04:43.578357+00:00","updated_at":"2026-05-18T00:04:43.578357+00:00"}