{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4MOEBBLWI4EOXLJIY23K52X5C7","short_pith_number":"pith:4MOEBBLW","schema_version":"1.0","canonical_sha256":"e31c4085764708ebad28c6b6aeeafd17c9181003a1f071f82017fd228a6b68dd","source":{"kind":"arxiv","id":"1510.08740","version":4},"attestation_state":"computed","paper":{"title":"The rate of convergence of Nesterov's accelerated forward-backward method is actually faster than $1/k^{2}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hedy Attouch, Juan Peypouquet","submitted_at":"2015-10-29T15:30:50Z","abstract_excerpt":"The {\\it forward-backward algorithm} is a powerful tool for solving optimization problems with a {\\it additively separable} and {\\it smooth} + {\\it nonsmooth} structure. In the convex setting, a simple but ingenious acceleration scheme developed by Nesterov has been proved useful to improve the theoretical rate of convergence for the function values from the standard $\\mathcal O(k^{-1})$ down to $\\mathcal O(k^{-2})$. In this short paper, we prove that the rate of convergence of a slight variant of Nesterov's accelerated forward-backward method, which produces {\\it convergent} sequences, is act"},"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":"1510.08740","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-29T15:30:50Z","cross_cats_sorted":[],"title_canon_sha256":"375d873936a4e5da9b54adfd343216e1e43f49ac3e9fff2428f277fd1f018787","abstract_canon_sha256":"93d9078ed071a2134d61a6ae98dbf66c494e71486a554a68415d53b4678fe7f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:18.870521Z","signature_b64":"bQpvCTDnmxZiH/vaEO9Wv/tx4OvUZnmEcoJunN5e1weUEbLDfQjwnw7TEXLmrdXjklCIufxMYqUXx3/2IkwYDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e31c4085764708ebad28c6b6aeeafd17c9181003a1f071f82017fd228a6b68dd","last_reissued_at":"2026-05-18T00:44:18.870080Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:18.870080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The rate of convergence of Nesterov's accelerated forward-backward method is actually faster than $1/k^{2}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hedy Attouch, Juan Peypouquet","submitted_at":"2015-10-29T15:30:50Z","abstract_excerpt":"The {\\it forward-backward algorithm} is a powerful tool for solving optimization problems with a {\\it additively separable} and {\\it smooth} + {\\it nonsmooth} structure. In the convex setting, a simple but ingenious acceleration scheme developed by Nesterov has been proved useful to improve the theoretical rate of convergence for the function values from the standard $\\mathcal O(k^{-1})$ down to $\\mathcal O(k^{-2})$. In this short paper, we prove that the rate of convergence of a slight variant of Nesterov's accelerated forward-backward method, which produces {\\it convergent} sequences, is act"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08740","kind":"arxiv","version":4},"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":"1510.08740","created_at":"2026-05-18T00:44:18.870156+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.08740v4","created_at":"2026-05-18T00:44:18.870156+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.08740","created_at":"2026-05-18T00:44:18.870156+00:00"},{"alias_kind":"pith_short_12","alias_value":"4MOEBBLWI4EO","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4MOEBBLWI4EOXLJI","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4MOEBBLW","created_at":"2026-05-18T12:29:05.191682+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/4MOEBBLWI4EOXLJIY23K52X5C7","json":"https://pith.science/pith/4MOEBBLWI4EOXLJIY23K52X5C7.json","graph_json":"https://pith.science/api/pith-number/4MOEBBLWI4EOXLJIY23K52X5C7/graph.json","events_json":"https://pith.science/api/pith-number/4MOEBBLWI4EOXLJIY23K52X5C7/events.json","paper":"https://pith.science/paper/4MOEBBLW"},"agent_actions":{"view_html":"https://pith.science/pith/4MOEBBLWI4EOXLJIY23K52X5C7","download_json":"https://pith.science/pith/4MOEBBLWI4EOXLJIY23K52X5C7.json","view_paper":"https://pith.science/paper/4MOEBBLW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.08740&json=true","fetch_graph":"https://pith.science/api/pith-number/4MOEBBLWI4EOXLJIY23K52X5C7/graph.json","fetch_events":"https://pith.science/api/pith-number/4MOEBBLWI4EOXLJIY23K52X5C7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4MOEBBLWI4EOXLJIY23K52X5C7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4MOEBBLWI4EOXLJIY23K52X5C7/action/storage_attestation","attest_author":"https://pith.science/pith/4MOEBBLWI4EOXLJIY23K52X5C7/action/author_attestation","sign_citation":"https://pith.science/pith/4MOEBBLWI4EOXLJIY23K52X5C7/action/citation_signature","submit_replication":"https://pith.science/pith/4MOEBBLWI4EOXLJIY23K52X5C7/action/replication_record"}},"created_at":"2026-05-18T00:44:18.870156+00:00","updated_at":"2026-05-18T00:44:18.870156+00:00"}