{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZYGLDRZP5JXQFFOTUFLP3DT5C4","short_pith_number":"pith:ZYGLDRZP","schema_version":"1.0","canonical_sha256":"ce0cb1c72fea6f0295d3a156fd8e7d17239becc4fa81f947a4fd238385d779f5","source":{"kind":"arxiv","id":"1810.10085","version":1},"attestation_state":"computed","paper":{"title":"A Proximal Zeroth-Order Algorithm for Nonconvex Nonsmooth Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Ehsan Kazemi, Liqiang Wang","submitted_at":"2018-10-17T18:28:51Z","abstract_excerpt":"In this paper, we focus on solving an important class of nonconvex optimization problems which includes many problems for example signal processing over a networked multi-agent system and distributed learning over networks. Motivated by many applications in which the local objective function is the sum of smooth but possibly nonconvex part, and non-smooth but convex part subject to a linear equality constraint, this paper proposes a proximal zeroth-order primal dual algorithm (PZO-PDA) that accounts for the information structure of the problem. This algorithm only utilize the zeroth-order info"},"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":"1810.10085","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-17T18:28:51Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"845c1a88fdc1cd18652dcec94d5e1f8bb594d54943e0a9f0bd0aee0baa989ac6","abstract_canon_sha256":"cb58fd8039781eda46d7ca26be6d32b679af96d21c78baa35311abaac12aa378"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:24.306335Z","signature_b64":"kgIPmLy475qd2rWYr/iji+Or7lG3dlGo/QQsQ9D6wbwkZSIiC8sjAdyn+b/juthkIMUjpzG471iq6g8hgUn1BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce0cb1c72fea6f0295d3a156fd8e7d17239becc4fa81f947a4fd238385d779f5","last_reissued_at":"2026-05-18T00:02:24.305749Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:24.305749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Proximal Zeroth-Order Algorithm for Nonconvex Nonsmooth Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Ehsan Kazemi, Liqiang Wang","submitted_at":"2018-10-17T18:28:51Z","abstract_excerpt":"In this paper, we focus on solving an important class of nonconvex optimization problems which includes many problems for example signal processing over a networked multi-agent system and distributed learning over networks. Motivated by many applications in which the local objective function is the sum of smooth but possibly nonconvex part, and non-smooth but convex part subject to a linear equality constraint, this paper proposes a proximal zeroth-order primal dual algorithm (PZO-PDA) that accounts for the information structure of the problem. This algorithm only utilize the zeroth-order info"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10085","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":"1810.10085","created_at":"2026-05-18T00:02:24.305860+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.10085v1","created_at":"2026-05-18T00:02:24.305860+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10085","created_at":"2026-05-18T00:02:24.305860+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZYGLDRZP5JXQ","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZYGLDRZP5JXQFFOT","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZYGLDRZP","created_at":"2026-05-18T12:33:07.085635+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/ZYGLDRZP5JXQFFOTUFLP3DT5C4","json":"https://pith.science/pith/ZYGLDRZP5JXQFFOTUFLP3DT5C4.json","graph_json":"https://pith.science/api/pith-number/ZYGLDRZP5JXQFFOTUFLP3DT5C4/graph.json","events_json":"https://pith.science/api/pith-number/ZYGLDRZP5JXQFFOTUFLP3DT5C4/events.json","paper":"https://pith.science/paper/ZYGLDRZP"},"agent_actions":{"view_html":"https://pith.science/pith/ZYGLDRZP5JXQFFOTUFLP3DT5C4","download_json":"https://pith.science/pith/ZYGLDRZP5JXQFFOTUFLP3DT5C4.json","view_paper":"https://pith.science/paper/ZYGLDRZP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.10085&json=true","fetch_graph":"https://pith.science/api/pith-number/ZYGLDRZP5JXQFFOTUFLP3DT5C4/graph.json","fetch_events":"https://pith.science/api/pith-number/ZYGLDRZP5JXQFFOTUFLP3DT5C4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZYGLDRZP5JXQFFOTUFLP3DT5C4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZYGLDRZP5JXQFFOTUFLP3DT5C4/action/storage_attestation","attest_author":"https://pith.science/pith/ZYGLDRZP5JXQFFOTUFLP3DT5C4/action/author_attestation","sign_citation":"https://pith.science/pith/ZYGLDRZP5JXQFFOTUFLP3DT5C4/action/citation_signature","submit_replication":"https://pith.science/pith/ZYGLDRZP5JXQFFOTUFLP3DT5C4/action/replication_record"}},"created_at":"2026-05-18T00:02:24.305860+00:00","updated_at":"2026-05-18T00:02:24.305860+00:00"}