{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:6QRNDE3FA7TOWNXZTGHSQYN6JB","short_pith_number":"pith:6QRNDE3F","schema_version":"1.0","canonical_sha256":"f422d1936507e6eb36f9998f2861be48442cff0aab8259fe111727498f21bf62","source":{"kind":"arxiv","id":"1403.6622","version":2},"attestation_state":"computed","paper":{"title":"Iteration complexity analysis of random coordinate descent methods for $\\ell_0$ regularized convex problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrei Patrascu, Ion Necoara","submitted_at":"2014-03-26T10:42:52Z","abstract_excerpt":"In this paper we analyze a family of general random block coordinate descent methods for the minimization of $\\ell_0$ regularized optimization problems, i.e. the objective function is composed of a smooth convex function and the $\\ell_0$ regularization. Our family of methods covers particular cases such as random block coordinate gradient descent and random proximal coordinate descent methods. We analyze necessary optimality conditions for this nonconvex $\\ell_0$ regularized problem and devise a separation of the set of local minima into restricted classes based on approximation versions of th"},"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":"1403.6622","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-26T10:42:52Z","cross_cats_sorted":[],"title_canon_sha256":"ac3ab20c873afc8ec5f84d67a928127bc0c65f15d9fec17b284b61f3e96b55b2","abstract_canon_sha256":"04506ea94c21ed7c0ade24572113edfc236c715c6ded08a02b6e41e122fc2895"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:22.928175Z","signature_b64":"PX/GtiEVT94EdOrClQ7UdOzzW+RYL3KEawE9hvFeh8YHRdXFV0JzYM4S7/NJX57I3vrqKCRyUNhfvX9LPF8SCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f422d1936507e6eb36f9998f2861be48442cff0aab8259fe111727498f21bf62","last_reissued_at":"2026-05-18T02:47:22.927605Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:22.927605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Iteration complexity analysis of random coordinate descent methods for $\\ell_0$ regularized convex problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrei Patrascu, Ion Necoara","submitted_at":"2014-03-26T10:42:52Z","abstract_excerpt":"In this paper we analyze a family of general random block coordinate descent methods for the minimization of $\\ell_0$ regularized optimization problems, i.e. the objective function is composed of a smooth convex function and the $\\ell_0$ regularization. Our family of methods covers particular cases such as random block coordinate gradient descent and random proximal coordinate descent methods. We analyze necessary optimality conditions for this nonconvex $\\ell_0$ regularized problem and devise a separation of the set of local minima into restricted classes based on approximation versions of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6622","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":"1403.6622","created_at":"2026-05-18T02:47:22.927690+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.6622v2","created_at":"2026-05-18T02:47:22.927690+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6622","created_at":"2026-05-18T02:47:22.927690+00:00"},{"alias_kind":"pith_short_12","alias_value":"6QRNDE3FA7TO","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"6QRNDE3FA7TOWNXZ","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"6QRNDE3F","created_at":"2026-05-18T12:28:16.859392+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/6QRNDE3FA7TOWNXZTGHSQYN6JB","json":"https://pith.science/pith/6QRNDE3FA7TOWNXZTGHSQYN6JB.json","graph_json":"https://pith.science/api/pith-number/6QRNDE3FA7TOWNXZTGHSQYN6JB/graph.json","events_json":"https://pith.science/api/pith-number/6QRNDE3FA7TOWNXZTGHSQYN6JB/events.json","paper":"https://pith.science/paper/6QRNDE3F"},"agent_actions":{"view_html":"https://pith.science/pith/6QRNDE3FA7TOWNXZTGHSQYN6JB","download_json":"https://pith.science/pith/6QRNDE3FA7TOWNXZTGHSQYN6JB.json","view_paper":"https://pith.science/paper/6QRNDE3F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.6622&json=true","fetch_graph":"https://pith.science/api/pith-number/6QRNDE3FA7TOWNXZTGHSQYN6JB/graph.json","fetch_events":"https://pith.science/api/pith-number/6QRNDE3FA7TOWNXZTGHSQYN6JB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6QRNDE3FA7TOWNXZTGHSQYN6JB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6QRNDE3FA7TOWNXZTGHSQYN6JB/action/storage_attestation","attest_author":"https://pith.science/pith/6QRNDE3FA7TOWNXZTGHSQYN6JB/action/author_attestation","sign_citation":"https://pith.science/pith/6QRNDE3FA7TOWNXZTGHSQYN6JB/action/citation_signature","submit_replication":"https://pith.science/pith/6QRNDE3FA7TOWNXZTGHSQYN6JB/action/replication_record"}},"created_at":"2026-05-18T02:47:22.927690+00:00","updated_at":"2026-05-18T02:47:22.927690+00:00"}