{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DJOMVJ2EQA43RHR2SHY5ZUVDFY","short_pith_number":"pith:DJOMVJ2E","schema_version":"1.0","canonical_sha256":"1a5ccaa7448039b89e3a91f1dcd2a32e15ed53746ae335e31550cea088ef4830","source":{"kind":"arxiv","id":"1608.03487","version":2},"attestation_state":"computed","paper":{"title":"A Richer Theory of Convex Constrained Optimization with Reduced Projections and Improved Rates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Lijun Zhang, Qihang Lin, Tianbao Yang","submitted_at":"2016-08-11T14:48:18Z","abstract_excerpt":"This paper focuses on convex constrained optimization problems, where the solution is subject to a convex inequality constraint. In particular, we aim at challenging problems for which both projection into the constrained domain and a linear optimization under the inequality constraint are time-consuming, which render both projected gradient methods and conditional gradient methods (a.k.a. the Frank-Wolfe algorithm) expensive. In this paper, we develop projection reduced optimization algorithms for both smooth and non-smooth optimization with improved convergence rates under a certain regulari"},"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":"1608.03487","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-11T14:48:18Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"416211be8e486b1222c9db2f9279d39b391e45ca1b92dd92260ed71e31019c75","abstract_canon_sha256":"427523daa3504fecb593884f3fb2b69b957486dec895654b55ea4467ddf40080"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:35.160877Z","signature_b64":"9Se90JAsnN47dvd3zJeJp4C96eAET7AMVm8+JiYntYdY048g9kcd8CZt6ex9OuFp3Xcx9VsKr7J3VmKNfTAHAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a5ccaa7448039b89e3a91f1dcd2a32e15ed53746ae335e31550cea088ef4830","last_reissued_at":"2026-05-18T00:42:35.159724Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:35.159724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Richer Theory of Convex Constrained Optimization with Reduced Projections and Improved Rates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Lijun Zhang, Qihang Lin, Tianbao Yang","submitted_at":"2016-08-11T14:48:18Z","abstract_excerpt":"This paper focuses on convex constrained optimization problems, where the solution is subject to a convex inequality constraint. In particular, we aim at challenging problems for which both projection into the constrained domain and a linear optimization under the inequality constraint are time-consuming, which render both projected gradient methods and conditional gradient methods (a.k.a. the Frank-Wolfe algorithm) expensive. In this paper, we develop projection reduced optimization algorithms for both smooth and non-smooth optimization with improved convergence rates under a certain regulari"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03487","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":"1608.03487","created_at":"2026-05-18T00:42:35.160282+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.03487v2","created_at":"2026-05-18T00:42:35.160282+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03487","created_at":"2026-05-18T00:42:35.160282+00:00"},{"alias_kind":"pith_short_12","alias_value":"DJOMVJ2EQA43","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DJOMVJ2EQA43RHR2","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DJOMVJ2E","created_at":"2026-05-18T12:30:12.583610+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/DJOMVJ2EQA43RHR2SHY5ZUVDFY","json":"https://pith.science/pith/DJOMVJ2EQA43RHR2SHY5ZUVDFY.json","graph_json":"https://pith.science/api/pith-number/DJOMVJ2EQA43RHR2SHY5ZUVDFY/graph.json","events_json":"https://pith.science/api/pith-number/DJOMVJ2EQA43RHR2SHY5ZUVDFY/events.json","paper":"https://pith.science/paper/DJOMVJ2E"},"agent_actions":{"view_html":"https://pith.science/pith/DJOMVJ2EQA43RHR2SHY5ZUVDFY","download_json":"https://pith.science/pith/DJOMVJ2EQA43RHR2SHY5ZUVDFY.json","view_paper":"https://pith.science/paper/DJOMVJ2E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.03487&json=true","fetch_graph":"https://pith.science/api/pith-number/DJOMVJ2EQA43RHR2SHY5ZUVDFY/graph.json","fetch_events":"https://pith.science/api/pith-number/DJOMVJ2EQA43RHR2SHY5ZUVDFY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DJOMVJ2EQA43RHR2SHY5ZUVDFY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DJOMVJ2EQA43RHR2SHY5ZUVDFY/action/storage_attestation","attest_author":"https://pith.science/pith/DJOMVJ2EQA43RHR2SHY5ZUVDFY/action/author_attestation","sign_citation":"https://pith.science/pith/DJOMVJ2EQA43RHR2SHY5ZUVDFY/action/citation_signature","submit_replication":"https://pith.science/pith/DJOMVJ2EQA43RHR2SHY5ZUVDFY/action/replication_record"}},"created_at":"2026-05-18T00:42:35.160282+00:00","updated_at":"2026-05-18T00:42:35.160282+00:00"}