{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6QRM7G5HTTD2UHYTQHCMC7VEVR","short_pith_number":"pith:6QRM7G5H","schema_version":"1.0","canonical_sha256":"f422cf9ba79cc7aa1f1381c4c17ea4ac5b025238e3d3551eb6c48b6459655b5c","source":{"kind":"arxiv","id":"2407.17063","version":1},"attestation_state":"computed","paper":{"title":"Strong Convergence of FISTA Iterates under H{\\\"o}lderian and Quadratic Growth Conditions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Aude Rondepierre (INSA Toulouse, Charles Dossal (INSA Toulouse), DIBRIS), Hippolyte Labarri\\`ere (UniGe, Jean-Fran\\c{c}ois Aujol (IMB), LAAS-ROC)","submitted_at":"2024-07-24T07:45:13Z","abstract_excerpt":"Introduced by Beck and Teboulle, FISTA (for Fast Iterative Shrinkage-Thresholding Algorithm) is a first-order method widely used in convex optimization. Adapted from Nesterov's accelerated gradient method for convex functions, the generated sequence guarantees a decay of the function values of $\\mathcal{O}\\left(n^{-2}\\right)$ in the convex setting. We show that for coercive functions satisfying some local growth condition (namely a H\\''olderian or quadratic growth condition), this sequence strongly converges to a minimizer. This property, which has never been proved without assuming the unique"},"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":"2407.17063","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-07-24T07:45:13Z","cross_cats_sorted":[],"title_canon_sha256":"c87d54404942b631201c7c38ecbdc43f1497726453b27dc5a023e27bf5c08ebf","abstract_canon_sha256":"2fac344ccdd2988a3ee9fcf7074e1bf096d3836a393e821dc3b6c8c8fa8b4c3c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:48:01.688819Z","signature_b64":"XHOX+P2I916rq+1t8ySc1uVLxxhYeHvpo6zID5UvK4d1TmCJNlvSYVTmCMidbzbptNXTWfxGQKMmTPPKogNXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f422cf9ba79cc7aa1f1381c4c17ea4ac5b025238e3d3551eb6c48b6459655b5c","last_reissued_at":"2026-07-05T08:48:01.688409Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:48:01.688409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong Convergence of FISTA Iterates under H{\\\"o}lderian and Quadratic Growth Conditions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Aude Rondepierre (INSA Toulouse, Charles Dossal (INSA Toulouse), DIBRIS), Hippolyte Labarri\\`ere (UniGe, Jean-Fran\\c{c}ois Aujol (IMB), LAAS-ROC)","submitted_at":"2024-07-24T07:45:13Z","abstract_excerpt":"Introduced by Beck and Teboulle, FISTA (for Fast Iterative Shrinkage-Thresholding Algorithm) is a first-order method widely used in convex optimization. Adapted from Nesterov's accelerated gradient method for convex functions, the generated sequence guarantees a decay of the function values of $\\mathcal{O}\\left(n^{-2}\\right)$ in the convex setting. We show that for coercive functions satisfying some local growth condition (namely a H\\''olderian or quadratic growth condition), this sequence strongly converges to a minimizer. This property, which has never been proved without assuming the unique"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.17063","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2407.17063/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":"2407.17063","created_at":"2026-07-05T08:48:01.688464+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.17063v1","created_at":"2026-07-05T08:48:01.688464+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.17063","created_at":"2026-07-05T08:48:01.688464+00:00"},{"alias_kind":"pith_short_12","alias_value":"6QRM7G5HTTD2","created_at":"2026-07-05T08:48:01.688464+00:00"},{"alias_kind":"pith_short_16","alias_value":"6QRM7G5HTTD2UHYT","created_at":"2026-07-05T08:48:01.688464+00:00"},{"alias_kind":"pith_short_8","alias_value":"6QRM7G5H","created_at":"2026-07-05T08:48:01.688464+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.03404","citing_title":"On the Effectiveness of the z-Transform Method in Quadratic Optimization","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6QRM7G5HTTD2UHYTQHCMC7VEVR","json":"https://pith.science/pith/6QRM7G5HTTD2UHYTQHCMC7VEVR.json","graph_json":"https://pith.science/api/pith-number/6QRM7G5HTTD2UHYTQHCMC7VEVR/graph.json","events_json":"https://pith.science/api/pith-number/6QRM7G5HTTD2UHYTQHCMC7VEVR/events.json","paper":"https://pith.science/paper/6QRM7G5H"},"agent_actions":{"view_html":"https://pith.science/pith/6QRM7G5HTTD2UHYTQHCMC7VEVR","download_json":"https://pith.science/pith/6QRM7G5HTTD2UHYTQHCMC7VEVR.json","view_paper":"https://pith.science/paper/6QRM7G5H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.17063&json=true","fetch_graph":"https://pith.science/api/pith-number/6QRM7G5HTTD2UHYTQHCMC7VEVR/graph.json","fetch_events":"https://pith.science/api/pith-number/6QRM7G5HTTD2UHYTQHCMC7VEVR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6QRM7G5HTTD2UHYTQHCMC7VEVR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6QRM7G5HTTD2UHYTQHCMC7VEVR/action/storage_attestation","attest_author":"https://pith.science/pith/6QRM7G5HTTD2UHYTQHCMC7VEVR/action/author_attestation","sign_citation":"https://pith.science/pith/6QRM7G5HTTD2UHYTQHCMC7VEVR/action/citation_signature","submit_replication":"https://pith.science/pith/6QRM7G5HTTD2UHYTQHCMC7VEVR/action/replication_record"}},"created_at":"2026-07-05T08:48:01.688464+00:00","updated_at":"2026-07-05T08:48:01.688464+00:00"}