{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4FXDCSXFTPUEXW2M4AKIHJAE4F","short_pith_number":"pith:4FXDCSXF","schema_version":"1.0","canonical_sha256":"e16e314ae59be84bdb4ce01483a404e15c2dc91c36b68cf1e4c9b8a25041fd4a","source":{"kind":"arxiv","id":"1909.00918","version":1},"attestation_state":"computed","paper":{"title":"Efficiency of Coordinate Descent Methods For Structured Nonconvex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Chenghao Lan, Qi Deng","submitted_at":"2019-09-03T02:11:11Z","abstract_excerpt":"Novel coordinate descent (CD) methods are proposed for minimizing nonconvex functions consisting of three terms: (i) a continuously differentiable term, (ii) a simple convex term, and (iii) a concave and continuous term. First, by extending randomized CD to nonsmooth nonconvex settings, we develop a coordinate subgradient method that randomly updates block-coordinate variables by using block composite subgradient mapping. This method converges asymptotically to critical points with proven sublinear convergence rate for certain optimality measures. Second, we develop a randomly permuted CD meth"},"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":"1909.00918","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-09-03T02:11:11Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"a2cc7aa41dab7bdeb7196ab182423a88a36a67e1e0b99122cdcc15cfb2709f9e","abstract_canon_sha256":"0165e7ddeb813ec34a66c34cc2a82245354a9d66fd693ded3e92fea088549065"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:04:19.545251Z","signature_b64":"k+McI4sBnWhFp+R47BzaKRmUgdCWASbPytjz4fXFRZcKLP8XMiEIX2A5dice/pqBEkEhZzSjJgWgDWeV1L1nDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e16e314ae59be84bdb4ce01483a404e15c2dc91c36b68cf1e4c9b8a25041fd4a","last_reissued_at":"2026-07-05T00:04:19.544590Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:04:19.544590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficiency of Coordinate Descent Methods For Structured Nonconvex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Chenghao Lan, Qi Deng","submitted_at":"2019-09-03T02:11:11Z","abstract_excerpt":"Novel coordinate descent (CD) methods are proposed for minimizing nonconvex functions consisting of three terms: (i) a continuously differentiable term, (ii) a simple convex term, and (iii) a concave and continuous term. First, by extending randomized CD to nonsmooth nonconvex settings, we develop a coordinate subgradient method that randomly updates block-coordinate variables by using block composite subgradient mapping. This method converges asymptotically to critical points with proven sublinear convergence rate for certain optimality measures. Second, we develop a randomly permuted CD meth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.00918","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1909.00918/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":"1909.00918","created_at":"2026-07-05T00:04:19.544680+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.00918v1","created_at":"2026-07-05T00:04:19.544680+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.00918","created_at":"2026-07-05T00:04:19.544680+00:00"},{"alias_kind":"pith_short_12","alias_value":"4FXDCSXFTPUE","created_at":"2026-07-05T00:04:19.544680+00:00"},{"alias_kind":"pith_short_16","alias_value":"4FXDCSXFTPUEXW2M","created_at":"2026-07-05T00:04:19.544680+00:00"},{"alias_kind":"pith_short_8","alias_value":"4FXDCSXF","created_at":"2026-07-05T00:04:19.544680+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/4FXDCSXFTPUEXW2M4AKIHJAE4F","json":"https://pith.science/pith/4FXDCSXFTPUEXW2M4AKIHJAE4F.json","graph_json":"https://pith.science/api/pith-number/4FXDCSXFTPUEXW2M4AKIHJAE4F/graph.json","events_json":"https://pith.science/api/pith-number/4FXDCSXFTPUEXW2M4AKIHJAE4F/events.json","paper":"https://pith.science/paper/4FXDCSXF"},"agent_actions":{"view_html":"https://pith.science/pith/4FXDCSXFTPUEXW2M4AKIHJAE4F","download_json":"https://pith.science/pith/4FXDCSXFTPUEXW2M4AKIHJAE4F.json","view_paper":"https://pith.science/paper/4FXDCSXF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.00918&json=true","fetch_graph":"https://pith.science/api/pith-number/4FXDCSXFTPUEXW2M4AKIHJAE4F/graph.json","fetch_events":"https://pith.science/api/pith-number/4FXDCSXFTPUEXW2M4AKIHJAE4F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4FXDCSXFTPUEXW2M4AKIHJAE4F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4FXDCSXFTPUEXW2M4AKIHJAE4F/action/storage_attestation","attest_author":"https://pith.science/pith/4FXDCSXFTPUEXW2M4AKIHJAE4F/action/author_attestation","sign_citation":"https://pith.science/pith/4FXDCSXFTPUEXW2M4AKIHJAE4F/action/citation_signature","submit_replication":"https://pith.science/pith/4FXDCSXFTPUEXW2M4AKIHJAE4F/action/replication_record"}},"created_at":"2026-07-05T00:04:19.544680+00:00","updated_at":"2026-07-05T00:04:19.544680+00:00"}