{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:UK3UHNCSPFSPOK6OABVAHM6BA5","short_pith_number":"pith:UK3UHNCS","schema_version":"1.0","canonical_sha256":"a2b743b4527964f72bce006a03b3c1076e44a284c449d242691d885ba527e8ce","source":{"kind":"arxiv","id":"1209.2385","version":1},"attestation_state":"computed","paper":{"title":"A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Meisam Razaviyayn, Mingyi Hong, Zhi-Quan Luo","submitted_at":"2012-09-11T18:10:01Z","abstract_excerpt":"The block coordinate descent (BCD) method is widely used for minimizing a continuous function f of several block variables. At each iteration of this method, a single block of variables is optimized, while the remaining variables are held fixed. To ensure the convergence of the BCD method, the subproblem to be optimized in each iteration needs to be solved exactly to its unique optimal solution. Unfortunately, these requirements are often too restrictive for many practical scenarios. In this paper, we study an alternative inexact BCD approach which updates the variable blocks by successively m"},"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":"1209.2385","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-09-11T18:10:01Z","cross_cats_sorted":[],"title_canon_sha256":"0de5a992ba131e5f1238419b4de75e1332df41bbfa85d7de329834b4b22605af","abstract_canon_sha256":"0d660b1b5c210190939c58fd1deb281e6f97ce36a22dcd5a0abe59eb97abfd25"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:52.050375Z","signature_b64":"OwHsE5lyqp9mVTo1Lchk4hHDb/Aw7WfY2nuXQQehzUTwaMtOoDlnjTR/gi+YX12KH4b33E3pTCNowJOi0U68BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2b743b4527964f72bce006a03b3c1076e44a284c449d242691d885ba527e8ce","last_reissued_at":"2026-05-18T03:45:52.049698Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:52.049698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Meisam Razaviyayn, Mingyi Hong, Zhi-Quan Luo","submitted_at":"2012-09-11T18:10:01Z","abstract_excerpt":"The block coordinate descent (BCD) method is widely used for minimizing a continuous function f of several block variables. At each iteration of this method, a single block of variables is optimized, while the remaining variables are held fixed. To ensure the convergence of the BCD method, the subproblem to be optimized in each iteration needs to be solved exactly to its unique optimal solution. Unfortunately, these requirements are often too restrictive for many practical scenarios. In this paper, we study an alternative inexact BCD approach which updates the variable blocks by successively m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.2385","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":"1209.2385","created_at":"2026-05-18T03:45:52.049779+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.2385v1","created_at":"2026-05-18T03:45:52.049779+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.2385","created_at":"2026-05-18T03:45:52.049779+00:00"},{"alias_kind":"pith_short_12","alias_value":"UK3UHNCSPFSP","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"UK3UHNCSPFSPOK6O","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"UK3UHNCS","created_at":"2026-05-18T12:27:23.164592+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/UK3UHNCSPFSPOK6OABVAHM6BA5","json":"https://pith.science/pith/UK3UHNCSPFSPOK6OABVAHM6BA5.json","graph_json":"https://pith.science/api/pith-number/UK3UHNCSPFSPOK6OABVAHM6BA5/graph.json","events_json":"https://pith.science/api/pith-number/UK3UHNCSPFSPOK6OABVAHM6BA5/events.json","paper":"https://pith.science/paper/UK3UHNCS"},"agent_actions":{"view_html":"https://pith.science/pith/UK3UHNCSPFSPOK6OABVAHM6BA5","download_json":"https://pith.science/pith/UK3UHNCSPFSPOK6OABVAHM6BA5.json","view_paper":"https://pith.science/paper/UK3UHNCS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.2385&json=true","fetch_graph":"https://pith.science/api/pith-number/UK3UHNCSPFSPOK6OABVAHM6BA5/graph.json","fetch_events":"https://pith.science/api/pith-number/UK3UHNCSPFSPOK6OABVAHM6BA5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UK3UHNCSPFSPOK6OABVAHM6BA5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UK3UHNCSPFSPOK6OABVAHM6BA5/action/storage_attestation","attest_author":"https://pith.science/pith/UK3UHNCSPFSPOK6OABVAHM6BA5/action/author_attestation","sign_citation":"https://pith.science/pith/UK3UHNCSPFSPOK6OABVAHM6BA5/action/citation_signature","submit_replication":"https://pith.science/pith/UK3UHNCSPFSPOK6OABVAHM6BA5/action/replication_record"}},"created_at":"2026-05-18T03:45:52.049779+00:00","updated_at":"2026-05-18T03:45:52.049779+00:00"}