{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:57K2UXGFHLYIB5I67U2Y4KZAB4","short_pith_number":"pith:57K2UXGF","schema_version":"1.0","canonical_sha256":"efd5aa5cc53af080f51efd358e2b200f0ff809f38ae9ed4f1f93ce517f856013","source":{"kind":"arxiv","id":"1406.5439","version":1},"attestation_state":"computed","paper":{"title":"A forward-backward view of some primal-dual optimization methods in image recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bang Cong Vu, Jean-Christophe Pesquet, Laurent Condat, Patrick L. Combettes","submitted_at":"2014-06-20T15:58:27Z","abstract_excerpt":"A wide array of image recovery problems can be abstracted into the problem of minimizing a sum of composite convex functions in a Hilbert space. To solve such problems, primal-dual proximal approaches have been developed which provide efficient solutions to large-scale optimization problems. The objective of this paper is to show that a number of existing algorithms can be derived from a general form of the forward-backward algorithm applied in a suitable product space. Our approach also allows us to develop useful extensions of existing algorithms by introducing a variable metric. An illustra"},"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":"1406.5439","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-06-20T15:58:27Z","cross_cats_sorted":[],"title_canon_sha256":"f5fd2c532714562e0293a1bc7c1e9d689d2f8115814a0ffc886516c566499750","abstract_canon_sha256":"c8a0fefce1ecd477b92a30302130dcc494b598190630e81e732644b1ea165e8c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:19.107149Z","signature_b64":"PN5SmUMdbvZ32eZFDQee6g2A9tnzx52PGQ+TN8PiFlKCmFcwKi0kp6iebYS6IwMvrjdFplI6bUdR1QGcc1KYAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efd5aa5cc53af080f51efd358e2b200f0ff809f38ae9ed4f1f93ce517f856013","last_reissued_at":"2026-05-18T02:49:19.106509Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:19.106509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A forward-backward view of some primal-dual optimization methods in image recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bang Cong Vu, Jean-Christophe Pesquet, Laurent Condat, Patrick L. Combettes","submitted_at":"2014-06-20T15:58:27Z","abstract_excerpt":"A wide array of image recovery problems can be abstracted into the problem of minimizing a sum of composite convex functions in a Hilbert space. To solve such problems, primal-dual proximal approaches have been developed which provide efficient solutions to large-scale optimization problems. The objective of this paper is to show that a number of existing algorithms can be derived from a general form of the forward-backward algorithm applied in a suitable product space. Our approach also allows us to develop useful extensions of existing algorithms by introducing a variable metric. An illustra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.5439","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":""},"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":"1406.5439","created_at":"2026-05-18T02:49:19.106616+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.5439v1","created_at":"2026-05-18T02:49:19.106616+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.5439","created_at":"2026-05-18T02:49:19.106616+00:00"},{"alias_kind":"pith_short_12","alias_value":"57K2UXGFHLYI","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"57K2UXGFHLYIB5I6","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"57K2UXGF","created_at":"2026-05-18T12:28:14.216126+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/57K2UXGFHLYIB5I67U2Y4KZAB4","json":"https://pith.science/pith/57K2UXGFHLYIB5I67U2Y4KZAB4.json","graph_json":"https://pith.science/api/pith-number/57K2UXGFHLYIB5I67U2Y4KZAB4/graph.json","events_json":"https://pith.science/api/pith-number/57K2UXGFHLYIB5I67U2Y4KZAB4/events.json","paper":"https://pith.science/paper/57K2UXGF"},"agent_actions":{"view_html":"https://pith.science/pith/57K2UXGFHLYIB5I67U2Y4KZAB4","download_json":"https://pith.science/pith/57K2UXGFHLYIB5I67U2Y4KZAB4.json","view_paper":"https://pith.science/paper/57K2UXGF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.5439&json=true","fetch_graph":"https://pith.science/api/pith-number/57K2UXGFHLYIB5I67U2Y4KZAB4/graph.json","fetch_events":"https://pith.science/api/pith-number/57K2UXGFHLYIB5I67U2Y4KZAB4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/57K2UXGFHLYIB5I67U2Y4KZAB4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/57K2UXGFHLYIB5I67U2Y4KZAB4/action/storage_attestation","attest_author":"https://pith.science/pith/57K2UXGFHLYIB5I67U2Y4KZAB4/action/author_attestation","sign_citation":"https://pith.science/pith/57K2UXGFHLYIB5I67U2Y4KZAB4/action/citation_signature","submit_replication":"https://pith.science/pith/57K2UXGFHLYIB5I67U2Y4KZAB4/action/replication_record"}},"created_at":"2026-05-18T02:49:19.106616+00:00","updated_at":"2026-05-18T02:49:19.106616+00:00"}