{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4DGI3ILI7NGQMUUK4Q5ICSGYZG","short_pith_number":"pith:4DGI3ILI","schema_version":"1.0","canonical_sha256":"e0cc8da168fb4d06528ae43a8148d8c98e0d68b38dd9024c55a4adc259753d50","source":{"kind":"arxiv","id":"1902.02221","version":1},"attestation_state":"computed","paper":{"title":"Bounding Computational Complexity under Cost Function Scaling in Predictive Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Eric C. Kerrigan, George A. Constantinides, Ian McInerney","submitted_at":"2019-02-06T15:00:48Z","abstract_excerpt":"We present a framework for upper bounding the number of iterations required by first-order optimization algorithms implementing constrained LQR controllers. We derive new bounds for the condition number and extremal eigenvalues of the primal and dual Hessian matrices when the cost function is scaled. These bounds are horizon-independent, allowing for their use with receding, variable and decreasing horizon controllers. We considerably relax prior assumptions on the structure of the weight matrices and assume only that the system is Schur-stable and the primal Hessian of the quadratic program ("},"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":"1902.02221","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-06T15:00:48Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"0c7021acd8775bef45221e693573042b91eb14035a131555e8150c4abf09eceb","abstract_canon_sha256":"59b60451338e72000987acc250045c6351a4f5052c79224807dda25623dac886"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:37.560440Z","signature_b64":"AlC7osn9e5/H1Vck0XnkOO767XYapCnBdBzMsy6aprJxiF5bR6a0sbovPmaLtA6Rql2605A/3haYRlzXGvXbAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0cc8da168fb4d06528ae43a8148d8c98e0d68b38dd9024c55a4adc259753d50","last_reissued_at":"2026-05-17T23:54:37.560008Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:37.560008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounding Computational Complexity under Cost Function Scaling in Predictive Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Eric C. Kerrigan, George A. Constantinides, Ian McInerney","submitted_at":"2019-02-06T15:00:48Z","abstract_excerpt":"We present a framework for upper bounding the number of iterations required by first-order optimization algorithms implementing constrained LQR controllers. We derive new bounds for the condition number and extremal eigenvalues of the primal and dual Hessian matrices when the cost function is scaled. These bounds are horizon-independent, allowing for their use with receding, variable and decreasing horizon controllers. We considerably relax prior assumptions on the structure of the weight matrices and assume only that the system is Schur-stable and the primal Hessian of the quadratic program ("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.02221","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":"1902.02221","created_at":"2026-05-17T23:54:37.560066+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.02221v1","created_at":"2026-05-17T23:54:37.560066+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.02221","created_at":"2026-05-17T23:54:37.560066+00:00"},{"alias_kind":"pith_short_12","alias_value":"4DGI3ILI7NGQ","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"4DGI3ILI7NGQMUUK","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"4DGI3ILI","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/4DGI3ILI7NGQMUUK4Q5ICSGYZG","json":"https://pith.science/pith/4DGI3ILI7NGQMUUK4Q5ICSGYZG.json","graph_json":"https://pith.science/api/pith-number/4DGI3ILI7NGQMUUK4Q5ICSGYZG/graph.json","events_json":"https://pith.science/api/pith-number/4DGI3ILI7NGQMUUK4Q5ICSGYZG/events.json","paper":"https://pith.science/paper/4DGI3ILI"},"agent_actions":{"view_html":"https://pith.science/pith/4DGI3ILI7NGQMUUK4Q5ICSGYZG","download_json":"https://pith.science/pith/4DGI3ILI7NGQMUUK4Q5ICSGYZG.json","view_paper":"https://pith.science/paper/4DGI3ILI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.02221&json=true","fetch_graph":"https://pith.science/api/pith-number/4DGI3ILI7NGQMUUK4Q5ICSGYZG/graph.json","fetch_events":"https://pith.science/api/pith-number/4DGI3ILI7NGQMUUK4Q5ICSGYZG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4DGI3ILI7NGQMUUK4Q5ICSGYZG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4DGI3ILI7NGQMUUK4Q5ICSGYZG/action/storage_attestation","attest_author":"https://pith.science/pith/4DGI3ILI7NGQMUUK4Q5ICSGYZG/action/author_attestation","sign_citation":"https://pith.science/pith/4DGI3ILI7NGQMUUK4Q5ICSGYZG/action/citation_signature","submit_replication":"https://pith.science/pith/4DGI3ILI7NGQMUUK4Q5ICSGYZG/action/replication_record"}},"created_at":"2026-05-17T23:54:37.560066+00:00","updated_at":"2026-05-17T23:54:37.560066+00:00"}