{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7U7ZHAQM25MGWMKQDV3N7NCVTQ","short_pith_number":"pith:7U7ZHAQM","schema_version":"1.0","canonical_sha256":"fd3f93820cd7586b31501d76dfb4559c2ea4ce04affa6f80e81b61e479b3d7ea","source":{"kind":"arxiv","id":"1809.09817","version":1},"attestation_state":"computed","paper":{"title":"Convex Relaxation of Bilinear Matrix Inequalities Part II: Applications to Optimal Control Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Fariba Zohrizadeh, Mohsen Kheirandishfard, Muhammad Adil, Ramtin Madani","submitted_at":"2018-09-26T05:36:28Z","abstract_excerpt":"The first part of this paper proposed a family of penalized convex relaxations for solving optimization problems with bilinear matrix inequality (BMI) constraints. In this part, we generalize our approach to a sequential scheme which starts from an arbitrary initial point (feasible or infeasible) and solves a sequence of penalized convex relaxations in order to find feasible and near-optimal solutions for BMI optimization problems. We evaluate the performance of the proposed method on the H2 and Hinfinity optimal controller design problems with both centralized and decentralized structures. Th"},"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.09817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-26T05:36:28Z","cross_cats_sorted":[],"title_canon_sha256":"98fd166c910f10b700e4d59ab8f63fd49b7c45aa6f82d19f4727c583b324b1f5","abstract_canon_sha256":"6d9ca4ffe1f318ea0929c793dc25db8839f2e279e8ba4eb81ea0a429cb443332"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:43.571139Z","signature_b64":"zQfmEq0y26kHheHDxxjByJaUKacLOG1K32/p5C/+TIMOeawIg60fPU9scW2X6c7RVh7AlmMWYDgHSvEe5/wxBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd3f93820cd7586b31501d76dfb4559c2ea4ce04affa6f80e81b61e479b3d7ea","last_reissued_at":"2026-05-18T00:04:43.570533Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:43.570533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convex Relaxation of Bilinear Matrix Inequalities Part II: Applications to Optimal Control Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Fariba Zohrizadeh, Mohsen Kheirandishfard, Muhammad Adil, Ramtin Madani","submitted_at":"2018-09-26T05:36:28Z","abstract_excerpt":"The first part of this paper proposed a family of penalized convex relaxations for solving optimization problems with bilinear matrix inequality (BMI) constraints. In this part, we generalize our approach to a sequential scheme which starts from an arbitrary initial point (feasible or infeasible) and solves a sequence of penalized convex relaxations in order to find feasible and near-optimal solutions for BMI optimization problems. We evaluate the performance of the proposed method on the H2 and Hinfinity optimal controller design problems with both centralized and decentralized structures. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09817","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.09817","created_at":"2026-05-18T00:04:43.570615+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.09817v1","created_at":"2026-05-18T00:04:43.570615+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09817","created_at":"2026-05-18T00:04:43.570615+00:00"},{"alias_kind":"pith_short_12","alias_value":"7U7ZHAQM25MG","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7U7ZHAQM25MGWMKQ","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7U7ZHAQM","created_at":"2026-05-18T12:32:11.075285+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/7U7ZHAQM25MGWMKQDV3N7NCVTQ","json":"https://pith.science/pith/7U7ZHAQM25MGWMKQDV3N7NCVTQ.json","graph_json":"https://pith.science/api/pith-number/7U7ZHAQM25MGWMKQDV3N7NCVTQ/graph.json","events_json":"https://pith.science/api/pith-number/7U7ZHAQM25MGWMKQDV3N7NCVTQ/events.json","paper":"https://pith.science/paper/7U7ZHAQM"},"agent_actions":{"view_html":"https://pith.science/pith/7U7ZHAQM25MGWMKQDV3N7NCVTQ","download_json":"https://pith.science/pith/7U7ZHAQM25MGWMKQDV3N7NCVTQ.json","view_paper":"https://pith.science/paper/7U7ZHAQM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.09817&json=true","fetch_graph":"https://pith.science/api/pith-number/7U7ZHAQM25MGWMKQDV3N7NCVTQ/graph.json","fetch_events":"https://pith.science/api/pith-number/7U7ZHAQM25MGWMKQDV3N7NCVTQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7U7ZHAQM25MGWMKQDV3N7NCVTQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7U7ZHAQM25MGWMKQDV3N7NCVTQ/action/storage_attestation","attest_author":"https://pith.science/pith/7U7ZHAQM25MGWMKQDV3N7NCVTQ/action/author_attestation","sign_citation":"https://pith.science/pith/7U7ZHAQM25MGWMKQDV3N7NCVTQ/action/citation_signature","submit_replication":"https://pith.science/pith/7U7ZHAQM25MGWMKQDV3N7NCVTQ/action/replication_record"}},"created_at":"2026-05-18T00:04:43.570615+00:00","updated_at":"2026-05-18T00:04:43.570615+00:00"}