{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PHHRJV3J5CHYEHIN2UH7H7GRNN","short_pith_number":"pith:PHHRJV3J","schema_version":"1.0","canonical_sha256":"79cf14d769e88f821d0dd50ff3fcd16b5a7c17fbb00abf2064b0279174837909","source":{"kind":"arxiv","id":"1608.03861","version":5},"attestation_state":"computed","paper":{"title":"Another look at the fast iterative shrinkage/thresholding algorithm (FISTA)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Donghwan Kim, Jeffrey A. Fessler","submitted_at":"2016-08-12T18:02:13Z","abstract_excerpt":"This paper provides a new way of developing the fast iterative shrinkage/thresholding algorithm (FISTA) that is widely used for minimizing composite convex functions with a nonsmooth term such as the $\\ell_1$ regularizer. In particular, this paper shows that FISTA corresponds to an optimized approach to accelerating the proximal gradient method with respect to a worst-case bound of the cost function. This paper then proposes a new algorithm that is derived by instead optimizing the step coefficients of the proximal gradient method with respect to a worst-case bound of the composite gradient ma"},"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":"1608.03861","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-12T18:02:13Z","cross_cats_sorted":[],"title_canon_sha256":"ad03a68d774ceb3b642e8e3c6b04e480f9c960ee43fecc00d78af34dc3dee7ae","abstract_canon_sha256":"071d3857344613866c282a2152a45d6467ab9a58b5dc48d207b3a7badc6fe6ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:28.797891Z","signature_b64":"55UDGX3XGhItwlCY0guqKOkamP9AvHy3qgZtJlTZJJMAUTVMO8r/p1Zw4UPc/4pSXXKE/0N9bHiHCxZnrM+GCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79cf14d769e88f821d0dd50ff3fcd16b5a7c17fbb00abf2064b0279174837909","last_reissued_at":"2026-05-17T23:43:28.797264Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:28.797264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Another look at the fast iterative shrinkage/thresholding algorithm (FISTA)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Donghwan Kim, Jeffrey A. Fessler","submitted_at":"2016-08-12T18:02:13Z","abstract_excerpt":"This paper provides a new way of developing the fast iterative shrinkage/thresholding algorithm (FISTA) that is widely used for minimizing composite convex functions with a nonsmooth term such as the $\\ell_1$ regularizer. In particular, this paper shows that FISTA corresponds to an optimized approach to accelerating the proximal gradient method with respect to a worst-case bound of the cost function. This paper then proposes a new algorithm that is derived by instead optimizing the step coefficients of the proximal gradient method with respect to a worst-case bound of the composite gradient ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03861","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":""},"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":"1608.03861","created_at":"2026-05-17T23:43:28.797382+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.03861v5","created_at":"2026-05-17T23:43:28.797382+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03861","created_at":"2026-05-17T23:43:28.797382+00:00"},{"alias_kind":"pith_short_12","alias_value":"PHHRJV3J5CHY","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PHHRJV3J5CHYEHIN","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PHHRJV3J","created_at":"2026-05-18T12:30:39.010887+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/PHHRJV3J5CHYEHIN2UH7H7GRNN","json":"https://pith.science/pith/PHHRJV3J5CHYEHIN2UH7H7GRNN.json","graph_json":"https://pith.science/api/pith-number/PHHRJV3J5CHYEHIN2UH7H7GRNN/graph.json","events_json":"https://pith.science/api/pith-number/PHHRJV3J5CHYEHIN2UH7H7GRNN/events.json","paper":"https://pith.science/paper/PHHRJV3J"},"agent_actions":{"view_html":"https://pith.science/pith/PHHRJV3J5CHYEHIN2UH7H7GRNN","download_json":"https://pith.science/pith/PHHRJV3J5CHYEHIN2UH7H7GRNN.json","view_paper":"https://pith.science/paper/PHHRJV3J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.03861&json=true","fetch_graph":"https://pith.science/api/pith-number/PHHRJV3J5CHYEHIN2UH7H7GRNN/graph.json","fetch_events":"https://pith.science/api/pith-number/PHHRJV3J5CHYEHIN2UH7H7GRNN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PHHRJV3J5CHYEHIN2UH7H7GRNN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PHHRJV3J5CHYEHIN2UH7H7GRNN/action/storage_attestation","attest_author":"https://pith.science/pith/PHHRJV3J5CHYEHIN2UH7H7GRNN/action/author_attestation","sign_citation":"https://pith.science/pith/PHHRJV3J5CHYEHIN2UH7H7GRNN/action/citation_signature","submit_replication":"https://pith.science/pith/PHHRJV3J5CHYEHIN2UH7H7GRNN/action/replication_record"}},"created_at":"2026-05-17T23:43:28.797382+00:00","updated_at":"2026-05-17T23:43:28.797382+00:00"}