{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:YWCOIE4FF43Q7ITYMTTO2G2PJY","short_pith_number":"pith:YWCOIE4F","schema_version":"1.0","canonical_sha256":"c584e413852f370fa27864e6ed1b4f4e08e48b2b002d718634f333ca6c9870f8","source":{"kind":"arxiv","id":"1203.4070","version":1},"attestation_state":"computed","paper":{"title":"An ADMM Algorithm for Solving l_1 Regularized MPC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Anders Hansson, Bo Wahlberg, Mariette Annergren","submitted_at":"2012-03-19T10:14:59Z","abstract_excerpt":"We present an Alternating Direction Method of Multipliers (ADMM) algorithm for solving optimization problems with an l_1 regularized least-squares cost function subject to recursive equality constraints. The considered optimization problem has applications in control, for example in l_1 regularized MPC. The ADMM algorithm is easy to implement, converges fast to a solution of moderate accuracy, and enables separation of the optimization problem into sub-problems that may be solved in parallel. We show that the most costly step of the proposed ADMM algorithm is equivalent to solving an LQ regula"},"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":"1203.4070","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-03-19T10:14:59Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"e33010ecc86ea312f59e369229e311185d3dded5675d01bd30a402fb1fcf283b","abstract_canon_sha256":"0a2e99aa042e8c4d46ffa9167781a07d83f32bba559ae541afe154e0fb78a1f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:48.343607Z","signature_b64":"uU2EBEJIjwJtkICx2L7OdyU+8SDPoop2eLfNxVYghhw6Pio8oYISr2YFtc8aZ3qr+QpDLFstzheO6b3x87feDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c584e413852f370fa27864e6ed1b4f4e08e48b2b002d718634f333ca6c9870f8","last_reissued_at":"2026-05-18T03:59:48.343112Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:48.343112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An ADMM Algorithm for Solving l_1 Regularized MPC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Anders Hansson, Bo Wahlberg, Mariette Annergren","submitted_at":"2012-03-19T10:14:59Z","abstract_excerpt":"We present an Alternating Direction Method of Multipliers (ADMM) algorithm for solving optimization problems with an l_1 regularized least-squares cost function subject to recursive equality constraints. The considered optimization problem has applications in control, for example in l_1 regularized MPC. The ADMM algorithm is easy to implement, converges fast to a solution of moderate accuracy, and enables separation of the optimization problem into sub-problems that may be solved in parallel. We show that the most costly step of the proposed ADMM algorithm is equivalent to solving an LQ regula"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.4070","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":"1203.4070","created_at":"2026-05-18T03:59:48.343184+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.4070v1","created_at":"2026-05-18T03:59:48.343184+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.4070","created_at":"2026-05-18T03:59:48.343184+00:00"},{"alias_kind":"pith_short_12","alias_value":"YWCOIE4FF43Q","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"YWCOIE4FF43Q7ITY","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"YWCOIE4F","created_at":"2026-05-18T12:27:30.460161+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/YWCOIE4FF43Q7ITYMTTO2G2PJY","json":"https://pith.science/pith/YWCOIE4FF43Q7ITYMTTO2G2PJY.json","graph_json":"https://pith.science/api/pith-number/YWCOIE4FF43Q7ITYMTTO2G2PJY/graph.json","events_json":"https://pith.science/api/pith-number/YWCOIE4FF43Q7ITYMTTO2G2PJY/events.json","paper":"https://pith.science/paper/YWCOIE4F"},"agent_actions":{"view_html":"https://pith.science/pith/YWCOIE4FF43Q7ITYMTTO2G2PJY","download_json":"https://pith.science/pith/YWCOIE4FF43Q7ITYMTTO2G2PJY.json","view_paper":"https://pith.science/paper/YWCOIE4F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.4070&json=true","fetch_graph":"https://pith.science/api/pith-number/YWCOIE4FF43Q7ITYMTTO2G2PJY/graph.json","fetch_events":"https://pith.science/api/pith-number/YWCOIE4FF43Q7ITYMTTO2G2PJY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YWCOIE4FF43Q7ITYMTTO2G2PJY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YWCOIE4FF43Q7ITYMTTO2G2PJY/action/storage_attestation","attest_author":"https://pith.science/pith/YWCOIE4FF43Q7ITYMTTO2G2PJY/action/author_attestation","sign_citation":"https://pith.science/pith/YWCOIE4FF43Q7ITYMTTO2G2PJY/action/citation_signature","submit_replication":"https://pith.science/pith/YWCOIE4FF43Q7ITYMTTO2G2PJY/action/replication_record"}},"created_at":"2026-05-18T03:59:48.343184+00:00","updated_at":"2026-05-18T03:59:48.343184+00:00"}