{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YNXIOVSDFRNOBKMQDEI7XXGEVL","short_pith_number":"pith:YNXIOVSD","schema_version":"1.0","canonical_sha256":"c36e8756432c5ae0a9901911fbdcc4aaf717c20d84f0f4df888119c30c4d79eb","source":{"kind":"arxiv","id":"1611.09805","version":4},"attestation_state":"computed","paper":{"title":"A new primal-dual algorithm for minimizing the sum of three functions with a linear operator","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA","stat.ML"],"primary_cat":"math.OC","authors_text":"Ming Yan","submitted_at":"2016-11-29T19:40:25Z","abstract_excerpt":"In this paper, we propose a new primal-dual algorithm for minimizing $f(x) + g(x) + h(Ax)$, where $f$, $g$, and $h$ are proper lower semi-continuous convex functions, $f$ is differentiable with a Lipschitz continuous gradient, and $A$ is a bounded linear operator. The proposed algorithm has some famous primal-dual algorithms for minimizing the sum of two functions as special cases. E.g., it reduces to the Chambolle-Pock algorithm when $f = 0$ and the proximal alternating predictor-corrector when $g = 0$. For the general convex case, we prove the convergence of this new algorithm in terms of th"},"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":"1611.09805","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-29T19:40:25Z","cross_cats_sorted":["math.NA","stat.ML"],"title_canon_sha256":"c7dc063fbc6af8396a12cf4cf44c935fac641bb1871695bcc04233c95e1774ec","abstract_canon_sha256":"9f4a6978ef5cf04af8ae7a47f9e7ab519a7ee34275783c9ea531f62abbfc9d78"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:02.062481Z","signature_b64":"trwgznx1CPpRUNkbfhISZBEAdrrGq0RKKlr/0LcAnesgV8jJ0kB9FM2fWL7nczbB91ZQueFQ3tQGMhIskdT8Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c36e8756432c5ae0a9901911fbdcc4aaf717c20d84f0f4df888119c30c4d79eb","last_reissued_at":"2026-05-18T00:25:02.061856Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:02.061856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new primal-dual algorithm for minimizing the sum of three functions with a linear operator","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA","stat.ML"],"primary_cat":"math.OC","authors_text":"Ming Yan","submitted_at":"2016-11-29T19:40:25Z","abstract_excerpt":"In this paper, we propose a new primal-dual algorithm for minimizing $f(x) + g(x) + h(Ax)$, where $f$, $g$, and $h$ are proper lower semi-continuous convex functions, $f$ is differentiable with a Lipschitz continuous gradient, and $A$ is a bounded linear operator. The proposed algorithm has some famous primal-dual algorithms for minimizing the sum of two functions as special cases. E.g., it reduces to the Chambolle-Pock algorithm when $f = 0$ and the proximal alternating predictor-corrector when $g = 0$. For the general convex case, we prove the convergence of this new algorithm in terms of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09805","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":"1611.09805","created_at":"2026-05-18T00:25:02.061930+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.09805v4","created_at":"2026-05-18T00:25:02.061930+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09805","created_at":"2026-05-18T00:25:02.061930+00:00"},{"alias_kind":"pith_short_12","alias_value":"YNXIOVSDFRNO","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YNXIOVSDFRNOBKMQ","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YNXIOVSD","created_at":"2026-05-18T12:30:53.716459+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/YNXIOVSDFRNOBKMQDEI7XXGEVL","json":"https://pith.science/pith/YNXIOVSDFRNOBKMQDEI7XXGEVL.json","graph_json":"https://pith.science/api/pith-number/YNXIOVSDFRNOBKMQDEI7XXGEVL/graph.json","events_json":"https://pith.science/api/pith-number/YNXIOVSDFRNOBKMQDEI7XXGEVL/events.json","paper":"https://pith.science/paper/YNXIOVSD"},"agent_actions":{"view_html":"https://pith.science/pith/YNXIOVSDFRNOBKMQDEI7XXGEVL","download_json":"https://pith.science/pith/YNXIOVSDFRNOBKMQDEI7XXGEVL.json","view_paper":"https://pith.science/paper/YNXIOVSD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.09805&json=true","fetch_graph":"https://pith.science/api/pith-number/YNXIOVSDFRNOBKMQDEI7XXGEVL/graph.json","fetch_events":"https://pith.science/api/pith-number/YNXIOVSDFRNOBKMQDEI7XXGEVL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YNXIOVSDFRNOBKMQDEI7XXGEVL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YNXIOVSDFRNOBKMQDEI7XXGEVL/action/storage_attestation","attest_author":"https://pith.science/pith/YNXIOVSDFRNOBKMQDEI7XXGEVL/action/author_attestation","sign_citation":"https://pith.science/pith/YNXIOVSDFRNOBKMQDEI7XXGEVL/action/citation_signature","submit_replication":"https://pith.science/pith/YNXIOVSDFRNOBKMQDEI7XXGEVL/action/replication_record"}},"created_at":"2026-05-18T00:25:02.061930+00:00","updated_at":"2026-05-18T00:25:02.061930+00:00"}