{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:UNNAR2XZQCSOCARTIRZQODAEQ5","short_pith_number":"pith:UNNAR2XZ","schema_version":"1.0","canonical_sha256":"a35a08eaf980a4e102334473070c04875d16d737534a512e974bef6bc01e9c67","source":{"kind":"arxiv","id":"2012.03503","version":6},"attestation_state":"computed","paper":{"title":"Block majorization-minimization with diminishing radius for constrained nonsmooth nonconvex optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Hanbaek Lyu, Yuchen Li","submitted_at":"2020-12-07T07:53:09Z","abstract_excerpt":"Block majorization-minimization (BMM) is a simple iterative algorithm for constrained nonconvex optimization that sequentially minimizes majorizing surrogates of the objective function in each block while the others are held fixed. BMM entails a large class of optimization algorithms such as block coordinate descent and its proximal-point variant, expectation-minimization, and block projected gradient descent. We first establish that for general constrained nonsmooth nonconvex optimization, BMM with $\\rho$-strongly convex and $L_g$-smooth surrogates can produce an $\\epsilon$-approximate first-"},"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":"2012.03503","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2020-12-07T07:53:09Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"520c2ce940d081f66a87522300c339d500c694127b11409d7e37bc1da3ea7118","abstract_canon_sha256":"f7c1ecaa84561a8bf4ad26d1b34bc8b8ff2eaa8cc45ce860af307059531c4e7b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:03:22.025629Z","signature_b64":"IB/fjnvWRi4VjHFZLUe9F4XN3rc05gTWEnENhD9Wem1oMtCSg4Q9RGUk/kHPpv2tVYBrAgsStJOL2jPw/XQKCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a35a08eaf980a4e102334473070c04875d16d737534a512e974bef6bc01e9c67","last_reissued_at":"2026-07-05T10:03:22.025153Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:03:22.025153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Block majorization-minimization with diminishing radius for constrained nonsmooth nonconvex optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Hanbaek Lyu, Yuchen Li","submitted_at":"2020-12-07T07:53:09Z","abstract_excerpt":"Block majorization-minimization (BMM) is a simple iterative algorithm for constrained nonconvex optimization that sequentially minimizes majorizing surrogates of the objective function in each block while the others are held fixed. BMM entails a large class of optimization algorithms such as block coordinate descent and its proximal-point variant, expectation-minimization, and block projected gradient descent. We first establish that for general constrained nonsmooth nonconvex optimization, BMM with $\\rho$-strongly convex and $L_g$-smooth surrogates can produce an $\\epsilon$-approximate first-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.03503","kind":"arxiv","version":6},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2012.03503/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2012.03503","created_at":"2026-07-05T10:03:22.025210+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.03503v6","created_at":"2026-07-05T10:03:22.025210+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.03503","created_at":"2026-07-05T10:03:22.025210+00:00"},{"alias_kind":"pith_short_12","alias_value":"UNNAR2XZQCSO","created_at":"2026-07-05T10:03:22.025210+00:00"},{"alias_kind":"pith_short_16","alias_value":"UNNAR2XZQCSOCART","created_at":"2026-07-05T10:03:22.025210+00:00"},{"alias_kind":"pith_short_8","alias_value":"UNNAR2XZ","created_at":"2026-07-05T10:03:22.025210+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/UNNAR2XZQCSOCARTIRZQODAEQ5","json":"https://pith.science/pith/UNNAR2XZQCSOCARTIRZQODAEQ5.json","graph_json":"https://pith.science/api/pith-number/UNNAR2XZQCSOCARTIRZQODAEQ5/graph.json","events_json":"https://pith.science/api/pith-number/UNNAR2XZQCSOCARTIRZQODAEQ5/events.json","paper":"https://pith.science/paper/UNNAR2XZ"},"agent_actions":{"view_html":"https://pith.science/pith/UNNAR2XZQCSOCARTIRZQODAEQ5","download_json":"https://pith.science/pith/UNNAR2XZQCSOCARTIRZQODAEQ5.json","view_paper":"https://pith.science/paper/UNNAR2XZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.03503&json=true","fetch_graph":"https://pith.science/api/pith-number/UNNAR2XZQCSOCARTIRZQODAEQ5/graph.json","fetch_events":"https://pith.science/api/pith-number/UNNAR2XZQCSOCARTIRZQODAEQ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UNNAR2XZQCSOCARTIRZQODAEQ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UNNAR2XZQCSOCARTIRZQODAEQ5/action/storage_attestation","attest_author":"https://pith.science/pith/UNNAR2XZQCSOCARTIRZQODAEQ5/action/author_attestation","sign_citation":"https://pith.science/pith/UNNAR2XZQCSOCARTIRZQODAEQ5/action/citation_signature","submit_replication":"https://pith.science/pith/UNNAR2XZQCSOCARTIRZQODAEQ5/action/replication_record"}},"created_at":"2026-07-05T10:03:22.025210+00:00","updated_at":"2026-07-05T10:03:22.025210+00:00"}