{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DXSFVE5CZTY7VNJ3SMZ3DPXYRX","short_pith_number":"pith:DXSFVE5C","schema_version":"1.0","canonical_sha256":"1de45a93a2ccf1fab53b9333b1bef88deb0a6746a39858798cf41245f5afbb22","source":{"kind":"arxiv","id":"1606.09365","version":2},"attestation_state":"computed","paper":{"title":"On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Adrien B. Taylor, Etienne de Klerk, Fran\\c{c}ois Glineur","submitted_at":"2016-06-30T06:51:10Z","abstract_excerpt":"We consider the gradient (or steepest) descent method with exact line search applied to a strongly convex function with Lipschitz continuous gradient. We establish the exact worst-case rate of convergence of this scheme, and show that this worst-case behavior is exhibited by a certain convex quadratic function. We also give the tight worst-case complexity bound for a noisy variant of gradient descent method, where exact line-search is performed in a search direction that differs from negative gradient by at most a prescribed relative tolerance.\n  The proofs are computer-assisted, and rely on t"},"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":"1606.09365","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-30T06:51:10Z","cross_cats_sorted":[],"title_canon_sha256":"5ceb9e2d44b6ab252825e1c39947ab55d96397c1bd1978d85853beab83964f81","abstract_canon_sha256":"472ed109800a49f558cd602a3331947302786c6ae85f21d23c71454b1299403e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:37.150001Z","signature_b64":"MrrSt49lLB/UpjrP3Psiby92fW/l7Ly17wS2NlzCM1Rr/nvkGRBoVMNSmdHL/8DuOd4Vy5A53eFbQ5mA6yuUCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1de45a93a2ccf1fab53b9333b1bef88deb0a6746a39858798cf41245f5afbb22","last_reissued_at":"2026-05-18T01:04:37.149307Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:37.149307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Adrien B. Taylor, Etienne de Klerk, Fran\\c{c}ois Glineur","submitted_at":"2016-06-30T06:51:10Z","abstract_excerpt":"We consider the gradient (or steepest) descent method with exact line search applied to a strongly convex function with Lipschitz continuous gradient. We establish the exact worst-case rate of convergence of this scheme, and show that this worst-case behavior is exhibited by a certain convex quadratic function. We also give the tight worst-case complexity bound for a noisy variant of gradient descent method, where exact line-search is performed in a search direction that differs from negative gradient by at most a prescribed relative tolerance.\n  The proofs are computer-assisted, and rely on t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.09365","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":"1606.09365","created_at":"2026-05-18T01:04:37.149410+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.09365v2","created_at":"2026-05-18T01:04:37.149410+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.09365","created_at":"2026-05-18T01:04:37.149410+00:00"},{"alias_kind":"pith_short_12","alias_value":"DXSFVE5CZTY7","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DXSFVE5CZTY7VNJ3","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DXSFVE5C","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/DXSFVE5CZTY7VNJ3SMZ3DPXYRX","json":"https://pith.science/pith/DXSFVE5CZTY7VNJ3SMZ3DPXYRX.json","graph_json":"https://pith.science/api/pith-number/DXSFVE5CZTY7VNJ3SMZ3DPXYRX/graph.json","events_json":"https://pith.science/api/pith-number/DXSFVE5CZTY7VNJ3SMZ3DPXYRX/events.json","paper":"https://pith.science/paper/DXSFVE5C"},"agent_actions":{"view_html":"https://pith.science/pith/DXSFVE5CZTY7VNJ3SMZ3DPXYRX","download_json":"https://pith.science/pith/DXSFVE5CZTY7VNJ3SMZ3DPXYRX.json","view_paper":"https://pith.science/paper/DXSFVE5C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.09365&json=true","fetch_graph":"https://pith.science/api/pith-number/DXSFVE5CZTY7VNJ3SMZ3DPXYRX/graph.json","fetch_events":"https://pith.science/api/pith-number/DXSFVE5CZTY7VNJ3SMZ3DPXYRX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DXSFVE5CZTY7VNJ3SMZ3DPXYRX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DXSFVE5CZTY7VNJ3SMZ3DPXYRX/action/storage_attestation","attest_author":"https://pith.science/pith/DXSFVE5CZTY7VNJ3SMZ3DPXYRX/action/author_attestation","sign_citation":"https://pith.science/pith/DXSFVE5CZTY7VNJ3SMZ3DPXYRX/action/citation_signature","submit_replication":"https://pith.science/pith/DXSFVE5CZTY7VNJ3SMZ3DPXYRX/action/replication_record"}},"created_at":"2026-05-18T01:04:37.149410+00:00","updated_at":"2026-05-18T01:04:37.149410+00:00"}