{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:NLRHVVQTJKYFJFLOADT3HQZZOB","short_pith_number":"pith:NLRHVVQT","schema_version":"1.0","canonical_sha256":"6ae27ad6134ab054956e00e7b3c339704d1af796917fd0326e677f6034f15615","source":{"kind":"arxiv","id":"1109.6058","version":1},"attestation_state":"computed","paper":{"title":"Accelerating Nesterov's Method for Strongly Convex Functions with Lipschitz Gradient","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hao Chen, Xiangrui Meng","submitted_at":"2011-09-27T23:04:31Z","abstract_excerpt":"We modify Nesterov's constant step gradient method for strongly convex functions with Lipschitz continuous gradient described in Nesterov's book. Nesterov shows that $f(x_k) - f^* \\leq L \\prod_{i=1}^k (1 - \\alpha_k) \\| x_0 - x^* \\|_2^2$ with $\\alpha_k = \\sqrt{\\rho}$ for all $k$, where $L$ is the Lipschitz gradient constant and $\\rho$ is the reciprocal condition number of $f(x)$. Hence the convergence rate is $1-\\sqrt{\\rho}$. In this work, we try to accelerate Nesterov's method by adaptively searching for an $\\alpha_k > \\sqrt{\\rho}$ at each iteration. The proposed method evaluates the gradient "},"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":"1109.6058","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-09-27T23:04:31Z","cross_cats_sorted":[],"title_canon_sha256":"d3fab6dbd3f255829f80283154981ffaf4fcecbdd4cd220f0148c169369b076e","abstract_canon_sha256":"ab2d05eb6ba73e35834a4c4e2e074d0e753da360a6954868ed8f7bf4c5960759"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:09.833407Z","signature_b64":"Yq2McTKsxY9YVSKavQRp1mADYwsiQ3c+WcA0fm4MQawWYFIrjxDGNrpmyypZknJfqsaLDiGMcF885l64Mm87AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ae27ad6134ab054956e00e7b3c339704d1af796917fd0326e677f6034f15615","last_reissued_at":"2026-05-18T04:12:09.832936Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:09.832936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerating Nesterov's Method for Strongly Convex Functions with Lipschitz Gradient","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hao Chen, Xiangrui Meng","submitted_at":"2011-09-27T23:04:31Z","abstract_excerpt":"We modify Nesterov's constant step gradient method for strongly convex functions with Lipschitz continuous gradient described in Nesterov's book. Nesterov shows that $f(x_k) - f^* \\leq L \\prod_{i=1}^k (1 - \\alpha_k) \\| x_0 - x^* \\|_2^2$ with $\\alpha_k = \\sqrt{\\rho}$ for all $k$, where $L$ is the Lipschitz gradient constant and $\\rho$ is the reciprocal condition number of $f(x)$. Hence the convergence rate is $1-\\sqrt{\\rho}$. In this work, we try to accelerate Nesterov's method by adaptively searching for an $\\alpha_k > \\sqrt{\\rho}$ at each iteration. The proposed method evaluates the gradient "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.6058","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":""},"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":"1109.6058","created_at":"2026-05-18T04:12:09.833009+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.6058v1","created_at":"2026-05-18T04:12:09.833009+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.6058","created_at":"2026-05-18T04:12:09.833009+00:00"},{"alias_kind":"pith_short_12","alias_value":"NLRHVVQTJKYF","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"NLRHVVQTJKYFJFLO","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"NLRHVVQT","created_at":"2026-05-18T12:26:37.096874+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/NLRHVVQTJKYFJFLOADT3HQZZOB","json":"https://pith.science/pith/NLRHVVQTJKYFJFLOADT3HQZZOB.json","graph_json":"https://pith.science/api/pith-number/NLRHVVQTJKYFJFLOADT3HQZZOB/graph.json","events_json":"https://pith.science/api/pith-number/NLRHVVQTJKYFJFLOADT3HQZZOB/events.json","paper":"https://pith.science/paper/NLRHVVQT"},"agent_actions":{"view_html":"https://pith.science/pith/NLRHVVQTJKYFJFLOADT3HQZZOB","download_json":"https://pith.science/pith/NLRHVVQTJKYFJFLOADT3HQZZOB.json","view_paper":"https://pith.science/paper/NLRHVVQT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.6058&json=true","fetch_graph":"https://pith.science/api/pith-number/NLRHVVQTJKYFJFLOADT3HQZZOB/graph.json","fetch_events":"https://pith.science/api/pith-number/NLRHVVQTJKYFJFLOADT3HQZZOB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NLRHVVQTJKYFJFLOADT3HQZZOB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NLRHVVQTJKYFJFLOADT3HQZZOB/action/storage_attestation","attest_author":"https://pith.science/pith/NLRHVVQTJKYFJFLOADT3HQZZOB/action/author_attestation","sign_citation":"https://pith.science/pith/NLRHVVQTJKYFJFLOADT3HQZZOB/action/citation_signature","submit_replication":"https://pith.science/pith/NLRHVVQTJKYFJFLOADT3HQZZOB/action/replication_record"}},"created_at":"2026-05-18T04:12:09.833009+00:00","updated_at":"2026-05-18T04:12:09.833009+00:00"}