{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7POTGSKXG3VV5SFXFS43M3J2CA","short_pith_number":"pith:7POTGSKX","schema_version":"1.0","canonical_sha256":"fbdd33495736eb5ec8b72cb9b66d3a103a0c89320f39b28b0e3b7e28d6e45c83","source":{"kind":"arxiv","id":"1406.3665","version":2},"attestation_state":"computed","paper":{"title":"Parallel Successive Convex Approximation for Nonsmooth Nonconvex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jong-Shi Pang, Meisam Razaviyayn, Mingyi Hong, Zhi-Quan Luo","submitted_at":"2014-06-13T23:11:53Z","abstract_excerpt":"Consider the problem of minimizing the sum of a smooth (possibly non-convex) and a convex (possibly nonsmooth) function involving a large number of variables. A popular approach to solve this problem is the block coordinate descent (BCD) method whereby at each iteration only one variable block is updated while the remaining variables are held fixed. With the recent advances in the developments of the multi-core parallel processing technology, it is desirable to parallelize the BCD method by allowing multiple blocks to be updated simultaneously at each iteration of the algorithm. In this work, "},"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.3665","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-06-13T23:11:53Z","cross_cats_sorted":[],"title_canon_sha256":"463873f348524f22fb46756d43dece5594c56bbe601dc6f2b0ae7b20afa9edf6","abstract_canon_sha256":"a1f6318463c311edc63aa0de700f82626f12e3d760f09f0ebc7da04d7d112f7f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:59.334407Z","signature_b64":"GGEYDvlO6Yeqsu6Bx/ab/XSl6uCUXkYwzod+DS8cnQcem2/CO5H6otyshfXQOuO1KjphJVS5Hfh72k6OlX00Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fbdd33495736eb5ec8b72cb9b66d3a103a0c89320f39b28b0e3b7e28d6e45c83","last_reissued_at":"2026-05-18T02:38:59.334005Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:59.334005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel Successive Convex Approximation for Nonsmooth Nonconvex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jong-Shi Pang, Meisam Razaviyayn, Mingyi Hong, Zhi-Quan Luo","submitted_at":"2014-06-13T23:11:53Z","abstract_excerpt":"Consider the problem of minimizing the sum of a smooth (possibly non-convex) and a convex (possibly nonsmooth) function involving a large number of variables. A popular approach to solve this problem is the block coordinate descent (BCD) method whereby at each iteration only one variable block is updated while the remaining variables are held fixed. With the recent advances in the developments of the multi-core parallel processing technology, it is desirable to parallelize the BCD method by allowing multiple blocks to be updated simultaneously at each iteration of the algorithm. In this work, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3665","kind":"arxiv","version":2},"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.3665","created_at":"2026-05-18T02:38:59.334063+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.3665v2","created_at":"2026-05-18T02:38:59.334063+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3665","created_at":"2026-05-18T02:38:59.334063+00:00"},{"alias_kind":"pith_short_12","alias_value":"7POTGSKXG3VV","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"7POTGSKXG3VV5SFX","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"7POTGSKX","created_at":"2026-05-18T12:28:19.803747+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/7POTGSKXG3VV5SFXFS43M3J2CA","json":"https://pith.science/pith/7POTGSKXG3VV5SFXFS43M3J2CA.json","graph_json":"https://pith.science/api/pith-number/7POTGSKXG3VV5SFXFS43M3J2CA/graph.json","events_json":"https://pith.science/api/pith-number/7POTGSKXG3VV5SFXFS43M3J2CA/events.json","paper":"https://pith.science/paper/7POTGSKX"},"agent_actions":{"view_html":"https://pith.science/pith/7POTGSKXG3VV5SFXFS43M3J2CA","download_json":"https://pith.science/pith/7POTGSKXG3VV5SFXFS43M3J2CA.json","view_paper":"https://pith.science/paper/7POTGSKX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.3665&json=true","fetch_graph":"https://pith.science/api/pith-number/7POTGSKXG3VV5SFXFS43M3J2CA/graph.json","fetch_events":"https://pith.science/api/pith-number/7POTGSKXG3VV5SFXFS43M3J2CA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7POTGSKXG3VV5SFXFS43M3J2CA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7POTGSKXG3VV5SFXFS43M3J2CA/action/storage_attestation","attest_author":"https://pith.science/pith/7POTGSKXG3VV5SFXFS43M3J2CA/action/author_attestation","sign_citation":"https://pith.science/pith/7POTGSKXG3VV5SFXFS43M3J2CA/action/citation_signature","submit_replication":"https://pith.science/pith/7POTGSKXG3VV5SFXFS43M3J2CA/action/replication_record"}},"created_at":"2026-05-18T02:38:59.334063+00:00","updated_at":"2026-05-18T02:38:59.334063+00:00"}