{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:3V62W2P3FZOMPTSVXL44JITJNJ","short_pith_number":"pith:3V62W2P3","schema_version":"1.0","canonical_sha256":"dd7dab69fb2e5cc7ce55baf9c4a2696a6212d1684a26834e0f82f9d62c763d53","source":{"kind":"arxiv","id":"1906.10396","version":1},"attestation_state":"computed","paper":{"title":"A hybrid penalty method for a class of optimization problems with multiple rank constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Akiko Takeda, Ivan Markovsky, Tianxiang Liu, Ting Kei Pong","submitted_at":"2019-06-25T09:08:39Z","abstract_excerpt":"In this paper, we consider the problem of minimizing a smooth objective over multiple rank constraints on Hankel-structured matrices. This kind of problems arises in system identification, system theory and signal processing, where the rank constraints are typically \"hard constraints\". To solve these problems, we propose a hybrid penalty method that combines a penalty method with a post-processing scheme. Specifically, we solve the penalty subproblems until the penalty parameter reaches a given threshold, and then switch to a local alternating \"pseudo-projection'' method to further reduce cons"},"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":"1906.10396","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-25T09:08:39Z","cross_cats_sorted":[],"title_canon_sha256":"9852aa283d85c8dda2d549959f96a88ae10fd35d1bff1a0cc9e62b1de5179e79","abstract_canon_sha256":"d125680109363d02c74df4e0d0284435b43e9d23a536b55d5041b71dae04b822"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:18.190113Z","signature_b64":"d+mm5H1DAM1QUVgm1wzPwOI+CKs4HnefJ3cQTN7v5Zmr+Zmt/p2JgyKsbpu+hZEvv7U0woKoM/4hZOEc8boZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd7dab69fb2e5cc7ce55baf9c4a2696a6212d1684a26834e0f82f9d62c763d53","last_reissued_at":"2026-05-17T23:42:18.189659Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:18.189659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A hybrid penalty method for a class of optimization problems with multiple rank constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Akiko Takeda, Ivan Markovsky, Tianxiang Liu, Ting Kei Pong","submitted_at":"2019-06-25T09:08:39Z","abstract_excerpt":"In this paper, we consider the problem of minimizing a smooth objective over multiple rank constraints on Hankel-structured matrices. This kind of problems arises in system identification, system theory and signal processing, where the rank constraints are typically \"hard constraints\". To solve these problems, we propose a hybrid penalty method that combines a penalty method with a post-processing scheme. Specifically, we solve the penalty subproblems until the penalty parameter reaches a given threshold, and then switch to a local alternating \"pseudo-projection'' method to further reduce cons"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.10396","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":"1906.10396","created_at":"2026-05-17T23:42:18.189726+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.10396v1","created_at":"2026-05-17T23:42:18.189726+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10396","created_at":"2026-05-17T23:42:18.189726+00:00"},{"alias_kind":"pith_short_12","alias_value":"3V62W2P3FZOM","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"3V62W2P3FZOMPTSV","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"3V62W2P3","created_at":"2026-05-18T12:33:10.108867+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/3V62W2P3FZOMPTSVXL44JITJNJ","json":"https://pith.science/pith/3V62W2P3FZOMPTSVXL44JITJNJ.json","graph_json":"https://pith.science/api/pith-number/3V62W2P3FZOMPTSVXL44JITJNJ/graph.json","events_json":"https://pith.science/api/pith-number/3V62W2P3FZOMPTSVXL44JITJNJ/events.json","paper":"https://pith.science/paper/3V62W2P3"},"agent_actions":{"view_html":"https://pith.science/pith/3V62W2P3FZOMPTSVXL44JITJNJ","download_json":"https://pith.science/pith/3V62W2P3FZOMPTSVXL44JITJNJ.json","view_paper":"https://pith.science/paper/3V62W2P3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.10396&json=true","fetch_graph":"https://pith.science/api/pith-number/3V62W2P3FZOMPTSVXL44JITJNJ/graph.json","fetch_events":"https://pith.science/api/pith-number/3V62W2P3FZOMPTSVXL44JITJNJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3V62W2P3FZOMPTSVXL44JITJNJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3V62W2P3FZOMPTSVXL44JITJNJ/action/storage_attestation","attest_author":"https://pith.science/pith/3V62W2P3FZOMPTSVXL44JITJNJ/action/author_attestation","sign_citation":"https://pith.science/pith/3V62W2P3FZOMPTSVXL44JITJNJ/action/citation_signature","submit_replication":"https://pith.science/pith/3V62W2P3FZOMPTSVXL44JITJNJ/action/replication_record"}},"created_at":"2026-05-17T23:42:18.189726+00:00","updated_at":"2026-05-17T23:42:18.189726+00:00"}