{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:RQVVL23TUIBWPVRCDIOTA5MBLZ","short_pith_number":"pith:RQVVL23T","schema_version":"1.0","canonical_sha256":"8c2b55eb73a20367d6221a1d3075815e7606430f8f380e3f8fbff08c1833b361","source":{"kind":"arxiv","id":"2503.13965","version":5},"attestation_state":"computed","paper":{"title":"First-Order Projected Algorithms With the Same Linear Convergence Rate Bounds as Their Unconstrained Counterparts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ioannis Lestas, Masaaki Nagahara, Mengmou Li","submitted_at":"2025-03-18T06:57:36Z","abstract_excerpt":"In this paper, we propose a systematic approach for extending first-order optimization algorithms, originally designed for unconstrained strongly convex problems, to handle closed convex set constraints. We show that the resulting projected algorithms retain the same linear convergence rate bounds, provided that the underlying unconstrained optimization algorithms admit a quadratic Lyapunov function obtained from integral quadratic constraint (IQC) analysis. The projected algorithms are constructed by applying a projection in the norm induced by the Lyapunov matrix, ensuring both constraint sa"},"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":"2503.13965","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-03-18T06:57:36Z","cross_cats_sorted":[],"title_canon_sha256":"15008c13c6bb1a7f5a1df4a23a67c510fda56bfad19a21685d3d5d79003f2386","abstract_canon_sha256":"2f22bfeb911f1aff512bb3a419ee77d359bd51e5e1328f4ca4d1c0251edc3e80"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T01:05:05.844686Z","signature_b64":"s3H29PtZ6ulT67U9KbJHO2igz5qX7hqsJsB+ih9JMlLaKUW/RN9SfXVt6mm5gczk6T1vBxbXxL6O8s8NXJFiBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c2b55eb73a20367d6221a1d3075815e7606430f8f380e3f8fbff08c1833b361","last_reissued_at":"2026-06-09T01:05:05.844179Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T01:05:05.844179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"First-Order Projected Algorithms With the Same Linear Convergence Rate Bounds as Their Unconstrained Counterparts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ioannis Lestas, Masaaki Nagahara, Mengmou Li","submitted_at":"2025-03-18T06:57:36Z","abstract_excerpt":"In this paper, we propose a systematic approach for extending first-order optimization algorithms, originally designed for unconstrained strongly convex problems, to handle closed convex set constraints. We show that the resulting projected algorithms retain the same linear convergence rate bounds, provided that the underlying unconstrained optimization algorithms admit a quadratic Lyapunov function obtained from integral quadratic constraint (IQC) analysis. The projected algorithms are constructed by applying a projection in the norm induced by the Lyapunov matrix, ensuring both constraint sa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.13965","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/2503.13965/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":"2503.13965","created_at":"2026-06-09T01:05:05.844240+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.13965v5","created_at":"2026-06-09T01:05:05.844240+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.13965","created_at":"2026-06-09T01:05:05.844240+00:00"},{"alias_kind":"pith_short_12","alias_value":"RQVVL23TUIBW","created_at":"2026-06-09T01:05:05.844240+00:00"},{"alias_kind":"pith_short_16","alias_value":"RQVVL23TUIBWPVRC","created_at":"2026-06-09T01:05:05.844240+00:00"},{"alias_kind":"pith_short_8","alias_value":"RQVVL23T","created_at":"2026-06-09T01:05:05.844240+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2605.22929","citing_title":"An optimal first-order method for smooth and strongly convex composite optimization and its stationary limit","ref_index":33,"is_internal_anchor":true},{"citing_arxiv_id":"2604.02762","citing_title":"A Canonical Structure for Constructing Projected First-Order Algorithms With Delayed Feedback","ref_index":33,"is_internal_anchor":true},{"citing_arxiv_id":"2604.15624","citing_title":"A Common Lyapunov Matrix Approach to the Exponential Stability of Augmented Primal-Dual Gradient Flow as LPV Systems","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RQVVL23TUIBWPVRCDIOTA5MBLZ","json":"https://pith.science/pith/RQVVL23TUIBWPVRCDIOTA5MBLZ.json","graph_json":"https://pith.science/api/pith-number/RQVVL23TUIBWPVRCDIOTA5MBLZ/graph.json","events_json":"https://pith.science/api/pith-number/RQVVL23TUIBWPVRCDIOTA5MBLZ/events.json","paper":"https://pith.science/paper/RQVVL23T"},"agent_actions":{"view_html":"https://pith.science/pith/RQVVL23TUIBWPVRCDIOTA5MBLZ","download_json":"https://pith.science/pith/RQVVL23TUIBWPVRCDIOTA5MBLZ.json","view_paper":"https://pith.science/paper/RQVVL23T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.13965&json=true","fetch_graph":"https://pith.science/api/pith-number/RQVVL23TUIBWPVRCDIOTA5MBLZ/graph.json","fetch_events":"https://pith.science/api/pith-number/RQVVL23TUIBWPVRCDIOTA5MBLZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RQVVL23TUIBWPVRCDIOTA5MBLZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RQVVL23TUIBWPVRCDIOTA5MBLZ/action/storage_attestation","attest_author":"https://pith.science/pith/RQVVL23TUIBWPVRCDIOTA5MBLZ/action/author_attestation","sign_citation":"https://pith.science/pith/RQVVL23TUIBWPVRCDIOTA5MBLZ/action/citation_signature","submit_replication":"https://pith.science/pith/RQVVL23TUIBWPVRCDIOTA5MBLZ/action/replication_record"}},"created_at":"2026-06-09T01:05:05.844240+00:00","updated_at":"2026-06-09T01:05:05.844240+00:00"}