{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GGRD2R7E7BXGHJBGYZNPHBA4FW","short_pith_number":"pith:GGRD2R7E","schema_version":"1.0","canonical_sha256":"31a23d47e4f86e63a426c65af3841c2da7bd6db33595ba3a38131266d4a7897b","source":{"kind":"arxiv","id":"1809.01275","version":3},"attestation_state":"computed","paper":{"title":"Solving Non-smooth Constrained Programs with Lower Complexity than $\\mathcal{O}(1/\\varepsilon)$: A Primal-Dual Homotopy Smoothing Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"math.OC","authors_text":"Hao Yu, Michael J. Neely, Qing Ling, Xiaohan Wei","submitted_at":"2018-09-05T00:26:58Z","abstract_excerpt":"We propose a new primal-dual homotopy smoothing algorithm for a linearly constrained convex program, where neither the primal nor the dual function has to be smooth or strongly convex. The best known iteration complexity solving such a non-smooth problem is $\\mathcal{O}(\\varepsilon^{-1})$. In this paper, we show that by leveraging a local error bound condition on the dual function, the proposed algorithm can achieve a better primal convergence time of $\\mathcal{O}\\left(\\varepsilon^{-2/(2+\\beta)}\\log_2(\\varepsilon^{-1})\\right)$, where $\\beta\\in(0,1]$ is a local error bound parameter. As an exam"},"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":"1809.01275","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-05T00:26:58Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"67b5240ac8c4c4f2a177312ede281431c2e2c4f8756579d715cd7276b4254092","abstract_canon_sha256":"708c925a7a60941f910d8228904948e35053405810a2c9fbad311e56ba487a3c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:24.713678Z","signature_b64":"ta8cYRA+kqjLzVNggqQzR8Wpb4CdxDhxnJlGhiSZJHMxCiS6RenD9vFy9NbQ3uvRnLdAVADxeFaC89KLoyu8DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31a23d47e4f86e63a426c65af3841c2da7bd6db33595ba3a38131266d4a7897b","last_reissued_at":"2026-05-18T00:02:24.713017Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:24.713017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Non-smooth Constrained Programs with Lower Complexity than $\\mathcal{O}(1/\\varepsilon)$: A Primal-Dual Homotopy Smoothing Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"math.OC","authors_text":"Hao Yu, Michael J. Neely, Qing Ling, Xiaohan Wei","submitted_at":"2018-09-05T00:26:58Z","abstract_excerpt":"We propose a new primal-dual homotopy smoothing algorithm for a linearly constrained convex program, where neither the primal nor the dual function has to be smooth or strongly convex. The best known iteration complexity solving such a non-smooth problem is $\\mathcal{O}(\\varepsilon^{-1})$. In this paper, we show that by leveraging a local error bound condition on the dual function, the proposed algorithm can achieve a better primal convergence time of $\\mathcal{O}\\left(\\varepsilon^{-2/(2+\\beta)}\\log_2(\\varepsilon^{-1})\\right)$, where $\\beta\\in(0,1]$ is a local error bound parameter. As an exam"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01275","kind":"arxiv","version":3},"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":"1809.01275","created_at":"2026-05-18T00:02:24.713103+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.01275v3","created_at":"2026-05-18T00:02:24.713103+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.01275","created_at":"2026-05-18T00:02:24.713103+00:00"},{"alias_kind":"pith_short_12","alias_value":"GGRD2R7E7BXG","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GGRD2R7E7BXGHJBG","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GGRD2R7E","created_at":"2026-05-18T12:32:25.280505+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/GGRD2R7E7BXGHJBGYZNPHBA4FW","json":"https://pith.science/pith/GGRD2R7E7BXGHJBGYZNPHBA4FW.json","graph_json":"https://pith.science/api/pith-number/GGRD2R7E7BXGHJBGYZNPHBA4FW/graph.json","events_json":"https://pith.science/api/pith-number/GGRD2R7E7BXGHJBGYZNPHBA4FW/events.json","paper":"https://pith.science/paper/GGRD2R7E"},"agent_actions":{"view_html":"https://pith.science/pith/GGRD2R7E7BXGHJBGYZNPHBA4FW","download_json":"https://pith.science/pith/GGRD2R7E7BXGHJBGYZNPHBA4FW.json","view_paper":"https://pith.science/paper/GGRD2R7E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.01275&json=true","fetch_graph":"https://pith.science/api/pith-number/GGRD2R7E7BXGHJBGYZNPHBA4FW/graph.json","fetch_events":"https://pith.science/api/pith-number/GGRD2R7E7BXGHJBGYZNPHBA4FW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GGRD2R7E7BXGHJBGYZNPHBA4FW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GGRD2R7E7BXGHJBGYZNPHBA4FW/action/storage_attestation","attest_author":"https://pith.science/pith/GGRD2R7E7BXGHJBGYZNPHBA4FW/action/author_attestation","sign_citation":"https://pith.science/pith/GGRD2R7E7BXGHJBGYZNPHBA4FW/action/citation_signature","submit_replication":"https://pith.science/pith/GGRD2R7E7BXGHJBGYZNPHBA4FW/action/replication_record"}},"created_at":"2026-05-18T00:02:24.713103+00:00","updated_at":"2026-05-18T00:02:24.713103+00:00"}