{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:4V56AH3NRC4R74V2JNLGK52VQV","short_pith_number":"pith:4V56AH3N","schema_version":"1.0","canonical_sha256":"e57be01f6d88b91ff2ba4b566577558546be2c2c96e4034f9771225910f42939","source":{"kind":"arxiv","id":"2109.04405","version":5},"attestation_state":"computed","paper":{"title":"An Accelerated Proximal Gradient-based Model Predictive Control Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Jia Wang, Ying Yang","submitted_at":"2021-09-09T16:45:19Z","abstract_excerpt":"In this letter, an accelerated quadratic programming (QP) algorithm is proposed based on the proximal gradient method. The algorithm can achieve convergence rate $O(1/p^{\\alpha})$, where $p$ is the iteration number and $\\alpha$ is the given positive integer. The proposed algorithm improves the convergence rate of existing algorithms that achieve $O(1/p^{2})$. The key idea is that iterative parameters are selected from a group of specific high order polynomial equations. The performance of the proposed algorithm is assessed on the randomly generated model predictive control (MPC) optimization p"},"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":"2109.04405","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-09-09T16:45:19Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"861a94b35a7e0bfb22b25b66ce765a79a737b9de44362f3f208339d6c5b3046c","abstract_canon_sha256":"4f4a2b6620ac8bc4cabdff47dd954aba761f49753e68849de8e794dd87ba4618"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:50:36.241526Z","signature_b64":"e+97SmSbAYxiLZWAGCUkIwbWOnIbOEoOu0MEVkAroDxYNPOoEHjS9a19e2hpPTFmDIhWedwJXAf9qLmhuchOCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e57be01f6d88b91ff2ba4b566577558546be2c2c96e4034f9771225910f42939","last_reissued_at":"2026-07-05T03:50:36.241094Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:50:36.241094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Accelerated Proximal Gradient-based Model Predictive Control Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Jia Wang, Ying Yang","submitted_at":"2021-09-09T16:45:19Z","abstract_excerpt":"In this letter, an accelerated quadratic programming (QP) algorithm is proposed based on the proximal gradient method. The algorithm can achieve convergence rate $O(1/p^{\\alpha})$, where $p$ is the iteration number and $\\alpha$ is the given positive integer. The proposed algorithm improves the convergence rate of existing algorithms that achieve $O(1/p^{2})$. The key idea is that iterative parameters are selected from a group of specific high order polynomial equations. The performance of the proposed algorithm is assessed on the randomly generated model predictive control (MPC) optimization p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.04405","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2109.04405/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2109.04405","created_at":"2026-07-05T03:50:36.241150+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.04405v5","created_at":"2026-07-05T03:50:36.241150+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.04405","created_at":"2026-07-05T03:50:36.241150+00:00"},{"alias_kind":"pith_short_12","alias_value":"4V56AH3NRC4R","created_at":"2026-07-05T03:50:36.241150+00:00"},{"alias_kind":"pith_short_16","alias_value":"4V56AH3NRC4R74V2","created_at":"2026-07-05T03:50:36.241150+00:00"},{"alias_kind":"pith_short_8","alias_value":"4V56AH3N","created_at":"2026-07-05T03:50:36.241150+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/4V56AH3NRC4R74V2JNLGK52VQV","json":"https://pith.science/pith/4V56AH3NRC4R74V2JNLGK52VQV.json","graph_json":"https://pith.science/api/pith-number/4V56AH3NRC4R74V2JNLGK52VQV/graph.json","events_json":"https://pith.science/api/pith-number/4V56AH3NRC4R74V2JNLGK52VQV/events.json","paper":"https://pith.science/paper/4V56AH3N"},"agent_actions":{"view_html":"https://pith.science/pith/4V56AH3NRC4R74V2JNLGK52VQV","download_json":"https://pith.science/pith/4V56AH3NRC4R74V2JNLGK52VQV.json","view_paper":"https://pith.science/paper/4V56AH3N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.04405&json=true","fetch_graph":"https://pith.science/api/pith-number/4V56AH3NRC4R74V2JNLGK52VQV/graph.json","fetch_events":"https://pith.science/api/pith-number/4V56AH3NRC4R74V2JNLGK52VQV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4V56AH3NRC4R74V2JNLGK52VQV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4V56AH3NRC4R74V2JNLGK52VQV/action/storage_attestation","attest_author":"https://pith.science/pith/4V56AH3NRC4R74V2JNLGK52VQV/action/author_attestation","sign_citation":"https://pith.science/pith/4V56AH3NRC4R74V2JNLGK52VQV/action/citation_signature","submit_replication":"https://pith.science/pith/4V56AH3NRC4R74V2JNLGK52VQV/action/replication_record"}},"created_at":"2026-07-05T03:50:36.241150+00:00","updated_at":"2026-07-05T03:50:36.241150+00:00"}