{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:7E24A5A4MKZT3U2ZYV2SEFA43C","short_pith_number":"pith:7E24A5A4","schema_version":"1.0","canonical_sha256":"f935c0741c62b33dd359c57522141cd894971cdc5d311cfec5071f79f2cf10be","source":{"kind":"arxiv","id":"1905.04208","version":1},"attestation_state":"computed","paper":{"title":"A Subspace Framework for ${\\mathcal H}_\\infty$-Norm Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Emre Mengi, Matthias Voigt, Nicat Aliyev, Peter Benner","submitted_at":"2019-05-10T15:11:04Z","abstract_excerpt":"We deal with the minimization of the ${\\mathcal H}_\\infty$-norm of the transfer function of a parameter-dependent descriptor system over the set of admissible parameter values. Subspace frameworks are proposed for such minimization problems where the involved systems are of large order. The proposed algorithms are greedy interpolatory approaches inspired by our recent work [Aliyev et al., SIAM J. Matrix Anal. Appl., 38(4):1496--1516, 2017] for the computation of the ${\\mathcal H}_\\infty$-norm. In this work, we minimize the ${\\mathcal H}_\\infty$-norm of a reduced-order parameter-dependent syste"},"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":"1905.04208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-05-10T15:11:04Z","cross_cats_sorted":[],"title_canon_sha256":"d43db3c6e53a2b557288e93cb1d4e646b14ed7f7f64ae25b0f92f5d7367cf488","abstract_canon_sha256":"8d991623995c3af178197263cf6c0be0ade40193fdad6bb1505bdbb5381e6f29"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:31.741624Z","signature_b64":"QzYOTdMgPsCmas7l9ucw3diwq1QyDBPxMlO31wToA29cVC+m7DshfWsjX92F+kccSuKAAaiGWRRxXNIGJypgDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f935c0741c62b33dd359c57522141cd894971cdc5d311cfec5071f79f2cf10be","last_reissued_at":"2026-05-17T23:46:31.741071Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:31.741071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Subspace Framework for ${\\mathcal H}_\\infty$-Norm Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Emre Mengi, Matthias Voigt, Nicat Aliyev, Peter Benner","submitted_at":"2019-05-10T15:11:04Z","abstract_excerpt":"We deal with the minimization of the ${\\mathcal H}_\\infty$-norm of the transfer function of a parameter-dependent descriptor system over the set of admissible parameter values. Subspace frameworks are proposed for such minimization problems where the involved systems are of large order. The proposed algorithms are greedy interpolatory approaches inspired by our recent work [Aliyev et al., SIAM J. Matrix Anal. Appl., 38(4):1496--1516, 2017] for the computation of the ${\\mathcal H}_\\infty$-norm. In this work, we minimize the ${\\mathcal H}_\\infty$-norm of a reduced-order parameter-dependent syste"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04208","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":"1905.04208","created_at":"2026-05-17T23:46:31.741155+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.04208v1","created_at":"2026-05-17T23:46:31.741155+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04208","created_at":"2026-05-17T23:46:31.741155+00:00"},{"alias_kind":"pith_short_12","alias_value":"7E24A5A4MKZT","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"7E24A5A4MKZT3U2Z","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"7E24A5A4","created_at":"2026-05-18T12:33:12.712433+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/7E24A5A4MKZT3U2ZYV2SEFA43C","json":"https://pith.science/pith/7E24A5A4MKZT3U2ZYV2SEFA43C.json","graph_json":"https://pith.science/api/pith-number/7E24A5A4MKZT3U2ZYV2SEFA43C/graph.json","events_json":"https://pith.science/api/pith-number/7E24A5A4MKZT3U2ZYV2SEFA43C/events.json","paper":"https://pith.science/paper/7E24A5A4"},"agent_actions":{"view_html":"https://pith.science/pith/7E24A5A4MKZT3U2ZYV2SEFA43C","download_json":"https://pith.science/pith/7E24A5A4MKZT3U2ZYV2SEFA43C.json","view_paper":"https://pith.science/paper/7E24A5A4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.04208&json=true","fetch_graph":"https://pith.science/api/pith-number/7E24A5A4MKZT3U2ZYV2SEFA43C/graph.json","fetch_events":"https://pith.science/api/pith-number/7E24A5A4MKZT3U2ZYV2SEFA43C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7E24A5A4MKZT3U2ZYV2SEFA43C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7E24A5A4MKZT3U2ZYV2SEFA43C/action/storage_attestation","attest_author":"https://pith.science/pith/7E24A5A4MKZT3U2ZYV2SEFA43C/action/author_attestation","sign_citation":"https://pith.science/pith/7E24A5A4MKZT3U2ZYV2SEFA43C/action/citation_signature","submit_replication":"https://pith.science/pith/7E24A5A4MKZT3U2ZYV2SEFA43C/action/replication_record"}},"created_at":"2026-05-17T23:46:31.741155+00:00","updated_at":"2026-05-17T23:46:31.741155+00:00"}