{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:26Y2JGJPZCF55JSL5M5JP5CPFB","short_pith_number":"pith:26Y2JGJP","schema_version":"1.0","canonical_sha256":"d7b1a4992fc88bdea64beb3a97f44f285d8052e57b6b752f1ac3235e1a884bf3","source":{"kind":"arxiv","id":"1808.05364","version":1},"attestation_state":"computed","paper":{"title":"A Smooth Double Proximal Primal-Dual Algorithm for a Class of Distributed Nonsmooth Optimization Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hao Fang, Jie Chen, Panos M. Pardalos, Xianlin Zeng, Yue Wei","submitted_at":"2018-08-16T07:28:00Z","abstract_excerpt":"This technical note studies a class of distributed nonsmooth convex consensus optimization problem. The cost function is a summation of local cost functions which are convex but nonsmooth. Each of the local cost functions consists of a twice differentiable convex function and two lower semi-continuous convex functions. We call this problem as single-smooth plus double-nonsmooth (SSDN) problem. Under mild conditions, we propose a distributed double proximal primal-dual optimization algorithm. The double proximal operator is designed to deal with the difficulty caused by the unproximable propert"},"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":"1808.05364","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-16T07:28:00Z","cross_cats_sorted":[],"title_canon_sha256":"e6622880aecc435fe89f1f2c1dca5d5db8fba75ec5c012c33bf8e66d51e7099a","abstract_canon_sha256":"ad6a9f36535b2128ec8155f7e7719b709631639b8dcbe18cd21a234ff50e7092"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:57.359567Z","signature_b64":"W/KIjIpqZyvEDRY25wn0Z6Mkd+WqeQ14QEE/HkkJLWKQnRXgksXuXdLNe2ozWwJSLurWr3cZcB7Svd1AfKlZBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7b1a4992fc88bdea64beb3a97f44f285d8052e57b6b752f1ac3235e1a884bf3","last_reissued_at":"2026-05-18T00:07:57.359030Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:57.359030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Smooth Double Proximal Primal-Dual Algorithm for a Class of Distributed Nonsmooth Optimization Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hao Fang, Jie Chen, Panos M. Pardalos, Xianlin Zeng, Yue Wei","submitted_at":"2018-08-16T07:28:00Z","abstract_excerpt":"This technical note studies a class of distributed nonsmooth convex consensus optimization problem. The cost function is a summation of local cost functions which are convex but nonsmooth. Each of the local cost functions consists of a twice differentiable convex function and two lower semi-continuous convex functions. We call this problem as single-smooth plus double-nonsmooth (SSDN) problem. Under mild conditions, we propose a distributed double proximal primal-dual optimization algorithm. The double proximal operator is designed to deal with the difficulty caused by the unproximable propert"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.05364","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":"1808.05364","created_at":"2026-05-18T00:07:57.359110+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.05364v1","created_at":"2026-05-18T00:07:57.359110+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.05364","created_at":"2026-05-18T00:07:57.359110+00:00"},{"alias_kind":"pith_short_12","alias_value":"26Y2JGJPZCF5","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"26Y2JGJPZCF55JSL","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"26Y2JGJP","created_at":"2026-05-18T12:31:59.375834+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/26Y2JGJPZCF55JSL5M5JP5CPFB","json":"https://pith.science/pith/26Y2JGJPZCF55JSL5M5JP5CPFB.json","graph_json":"https://pith.science/api/pith-number/26Y2JGJPZCF55JSL5M5JP5CPFB/graph.json","events_json":"https://pith.science/api/pith-number/26Y2JGJPZCF55JSL5M5JP5CPFB/events.json","paper":"https://pith.science/paper/26Y2JGJP"},"agent_actions":{"view_html":"https://pith.science/pith/26Y2JGJPZCF55JSL5M5JP5CPFB","download_json":"https://pith.science/pith/26Y2JGJPZCF55JSL5M5JP5CPFB.json","view_paper":"https://pith.science/paper/26Y2JGJP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.05364&json=true","fetch_graph":"https://pith.science/api/pith-number/26Y2JGJPZCF55JSL5M5JP5CPFB/graph.json","fetch_events":"https://pith.science/api/pith-number/26Y2JGJPZCF55JSL5M5JP5CPFB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/26Y2JGJPZCF55JSL5M5JP5CPFB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/26Y2JGJPZCF55JSL5M5JP5CPFB/action/storage_attestation","attest_author":"https://pith.science/pith/26Y2JGJPZCF55JSL5M5JP5CPFB/action/author_attestation","sign_citation":"https://pith.science/pith/26Y2JGJPZCF55JSL5M5JP5CPFB/action/citation_signature","submit_replication":"https://pith.science/pith/26Y2JGJPZCF55JSL5M5JP5CPFB/action/replication_record"}},"created_at":"2026-05-18T00:07:57.359110+00:00","updated_at":"2026-05-18T00:07:57.359110+00:00"}