{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HDCF2MFNTBI6QETGU5R2TEF7LH","short_pith_number":"pith:HDCF2MFN","schema_version":"1.0","canonical_sha256":"38c45d30ad9851e81266a763a990bf59db5e30ace312591b8e68edf850cc103a","source":{"kind":"arxiv","id":"1510.08573","version":3},"attestation_state":"computed","paper":{"title":"On the convergence analysis of the optimized gradient method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Donghwan Kim, Jeffrey A. Fessler","submitted_at":"2015-10-29T06:02:05Z","abstract_excerpt":"This paper considers the problem of unconstrained minimization of smooth convex functions having Lipschitz continuous gradients with known Lipschitz constant. We recently proposed an optimized gradient method (OGM) for this problem and showed that it has a worst-case convergence bound for the cost function decrease that is twice as small as that of Nesterov's fast gradient method (FGM), yet has a similarly efficient practical implementation. Drori showed recently that OGM has optimal complexity over the general class of first-order methods. This optimality makes it important to study fully the"},"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":"1510.08573","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-29T06:02:05Z","cross_cats_sorted":[],"title_canon_sha256":"569b777acd7d942195bfe867938a2fe865ca138a7eee038371e43d813ff89a22","abstract_canon_sha256":"13426dc629baea08ec1bcab101386b6fa4885acc824ff7aea12eb7caaec4855a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:28.870210Z","signature_b64":"DBcQ2N89Jr0eS2oacP0r6syhLDKrTTZ6DnV2QM7rdzdkMuOxsu6Q3mOhecjFe9/hoUdpqzsmdIUbCSge5GZvCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38c45d30ad9851e81266a763a990bf59db5e30ace312591b8e68edf850cc103a","last_reissued_at":"2026-05-17T23:43:28.869623Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:28.869623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the convergence analysis of the optimized gradient method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Donghwan Kim, Jeffrey A. Fessler","submitted_at":"2015-10-29T06:02:05Z","abstract_excerpt":"This paper considers the problem of unconstrained minimization of smooth convex functions having Lipschitz continuous gradients with known Lipschitz constant. We recently proposed an optimized gradient method (OGM) for this problem and showed that it has a worst-case convergence bound for the cost function decrease that is twice as small as that of Nesterov's fast gradient method (FGM), yet has a similarly efficient practical implementation. Drori showed recently that OGM has optimal complexity over the general class of first-order methods. This optimality makes it important to study fully the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08573","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":"1510.08573","created_at":"2026-05-17T23:43:28.869728+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.08573v3","created_at":"2026-05-17T23:43:28.869728+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.08573","created_at":"2026-05-17T23:43:28.869728+00:00"},{"alias_kind":"pith_short_12","alias_value":"HDCF2MFNTBI6","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"HDCF2MFNTBI6QETG","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"HDCF2MFN","created_at":"2026-05-18T12:29:22.688609+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/HDCF2MFNTBI6QETGU5R2TEF7LH","json":"https://pith.science/pith/HDCF2MFNTBI6QETGU5R2TEF7LH.json","graph_json":"https://pith.science/api/pith-number/HDCF2MFNTBI6QETGU5R2TEF7LH/graph.json","events_json":"https://pith.science/api/pith-number/HDCF2MFNTBI6QETGU5R2TEF7LH/events.json","paper":"https://pith.science/paper/HDCF2MFN"},"agent_actions":{"view_html":"https://pith.science/pith/HDCF2MFNTBI6QETGU5R2TEF7LH","download_json":"https://pith.science/pith/HDCF2MFNTBI6QETGU5R2TEF7LH.json","view_paper":"https://pith.science/paper/HDCF2MFN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.08573&json=true","fetch_graph":"https://pith.science/api/pith-number/HDCF2MFNTBI6QETGU5R2TEF7LH/graph.json","fetch_events":"https://pith.science/api/pith-number/HDCF2MFNTBI6QETGU5R2TEF7LH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HDCF2MFNTBI6QETGU5R2TEF7LH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HDCF2MFNTBI6QETGU5R2TEF7LH/action/storage_attestation","attest_author":"https://pith.science/pith/HDCF2MFNTBI6QETGU5R2TEF7LH/action/author_attestation","sign_citation":"https://pith.science/pith/HDCF2MFNTBI6QETGU5R2TEF7LH/action/citation_signature","submit_replication":"https://pith.science/pith/HDCF2MFNTBI6QETGU5R2TEF7LH/action/replication_record"}},"created_at":"2026-05-17T23:43:28.869728+00:00","updated_at":"2026-05-17T23:43:28.869728+00:00"}