{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:CXMMQMYBFLXM3CCALF4GHVQIIZ","short_pith_number":"pith:CXMMQMYB","schema_version":"1.0","canonical_sha256":"15d8c833012aeecd8840597863d6084655a29e1b0978663888e47022dc8d81eb","source":{"kind":"arxiv","id":"1303.4645","version":2},"attestation_state":"computed","paper":{"title":"Gradient methods for convex minimization: better rates under weaker conditions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.NA"],"primary_cat":"math.OC","authors_text":"Hui Zhang, Wotao Yin","submitted_at":"2013-03-19T16:03:17Z","abstract_excerpt":"The convergence behavior of gradient methods for minimizing convex differentiable functions is one of the core questions in convex optimization. This paper shows that their well-known complexities can be achieved under conditions weaker than the commonly accepted ones. We relax the common gradient Lipschitz-continuity condition and strong convexity condition to ones that hold only over certain line segments. Specifically, we establish complexities $O(\\frac{R}{\\epsilon})$ and $O(\\sqrt{\\frac{R}{\\epsilon}})$ for the ordinary and accelerate gradient methods, respectively, assuming that $\\nabla f$ "},"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":"1303.4645","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-19T16:03:17Z","cross_cats_sorted":["cs.IT","math.IT","math.NA"],"title_canon_sha256":"e937a49ad1343896ca18962481afd53b40e547f408ea3747831a4ec03d70b603","abstract_canon_sha256":"0999f9ed04c8de3c6768db56504f65dc65fc2b75017a0d5f8f287eb8ba0d56d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:58.049414Z","signature_b64":"SRhs4J7FJHklxrI597eRrDX68Ss5pNVguindCFpC7zICEbZUo1Dh4H8eFp5aC+RC17u1HSUqp+0f70/WS3XgCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15d8c833012aeecd8840597863d6084655a29e1b0978663888e47022dc8d81eb","last_reissued_at":"2026-05-18T03:13:58.048870Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:58.048870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gradient methods for convex minimization: better rates under weaker conditions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.NA"],"primary_cat":"math.OC","authors_text":"Hui Zhang, Wotao Yin","submitted_at":"2013-03-19T16:03:17Z","abstract_excerpt":"The convergence behavior of gradient methods for minimizing convex differentiable functions is one of the core questions in convex optimization. This paper shows that their well-known complexities can be achieved under conditions weaker than the commonly accepted ones. We relax the common gradient Lipschitz-continuity condition and strong convexity condition to ones that hold only over certain line segments. Specifically, we establish complexities $O(\\frac{R}{\\epsilon})$ and $O(\\sqrt{\\frac{R}{\\epsilon}})$ for the ordinary and accelerate gradient methods, respectively, assuming that $\\nabla f$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4645","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":"1303.4645","created_at":"2026-05-18T03:13:58.048950+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.4645v2","created_at":"2026-05-18T03:13:58.048950+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4645","created_at":"2026-05-18T03:13:58.048950+00:00"},{"alias_kind":"pith_short_12","alias_value":"CXMMQMYBFLXM","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"CXMMQMYBFLXM3CCA","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"CXMMQMYB","created_at":"2026-05-18T12:27:40.988391+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.19667","citing_title":"Convergence of Consensus-Based Particle Methods for Nonconvex Bi-Level Optimization","ref_index":78,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CXMMQMYBFLXM3CCALF4GHVQIIZ","json":"https://pith.science/pith/CXMMQMYBFLXM3CCALF4GHVQIIZ.json","graph_json":"https://pith.science/api/pith-number/CXMMQMYBFLXM3CCALF4GHVQIIZ/graph.json","events_json":"https://pith.science/api/pith-number/CXMMQMYBFLXM3CCALF4GHVQIIZ/events.json","paper":"https://pith.science/paper/CXMMQMYB"},"agent_actions":{"view_html":"https://pith.science/pith/CXMMQMYBFLXM3CCALF4GHVQIIZ","download_json":"https://pith.science/pith/CXMMQMYBFLXM3CCALF4GHVQIIZ.json","view_paper":"https://pith.science/paper/CXMMQMYB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.4645&json=true","fetch_graph":"https://pith.science/api/pith-number/CXMMQMYBFLXM3CCALF4GHVQIIZ/graph.json","fetch_events":"https://pith.science/api/pith-number/CXMMQMYBFLXM3CCALF4GHVQIIZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CXMMQMYBFLXM3CCALF4GHVQIIZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CXMMQMYBFLXM3CCALF4GHVQIIZ/action/storage_attestation","attest_author":"https://pith.science/pith/CXMMQMYBFLXM3CCALF4GHVQIIZ/action/author_attestation","sign_citation":"https://pith.science/pith/CXMMQMYBFLXM3CCALF4GHVQIIZ/action/citation_signature","submit_replication":"https://pith.science/pith/CXMMQMYBFLXM3CCALF4GHVQIIZ/action/replication_record"}},"created_at":"2026-05-18T03:13:58.048950+00:00","updated_at":"2026-05-18T03:13:58.048950+00:00"}