{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UZUM2NE5JXEVDNGPNE7SB3JRYC","short_pith_number":"pith:UZUM2NE5","schema_version":"1.0","canonical_sha256":"a668cd349d4dc951b4cf693f20ed31c0a1c6cc7e464a37381922beef4ae57e75","source":{"kind":"arxiv","id":"1502.05666","version":6},"attestation_state":"computed","paper":{"title":"Smooth Strongly Convex Interpolation and Exact Worst-case Performance of First-order Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Adrien B. Taylor, Fran\\c{c}ois Glineur, Julien M. Hendrickx","submitted_at":"2015-02-19T18:42:42Z","abstract_excerpt":"We show that the exact worst-case performance of fixed-step first-order methods for unconstrained optimization of smooth (possibly strongly) convex functions can be obtained by solving convex programs.\n  Finding the worst-case performance of a black-box first-order method is formulated as an optimization problem over a set of smooth (strongly) convex functions and initial conditions. We develop closed-form necessary and sufficient conditions for smooth (strongly) convex interpolation, which provide a finite representation for those functions. This allows us to reformulate the worst-case perfor"},"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":"1502.05666","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-02-19T18:42:42Z","cross_cats_sorted":[],"title_canon_sha256":"350d994ff5a19d0e63337d9e3520e1de1f19bd95c9638daaffc649a70a7fa4f7","abstract_canon_sha256":"47810046d55dd2a420f1e33bbf5a2a674f154f4888e86526764a71f7687e37aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:53.986622Z","signature_b64":"HbkxorxAGwdwVGNJrID8mNBDHbzLW5Eyd7LVC2imiEOzJEjY5+cuhP7yBgnoOJMQcfxEMBR7rVAGyddPGSHIAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a668cd349d4dc951b4cf693f20ed31c0a1c6cc7e464a37381922beef4ae57e75","last_reissued_at":"2026-05-18T01:00:53.985859Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:53.985859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Smooth Strongly Convex Interpolation and Exact Worst-case Performance of First-order Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Adrien B. Taylor, Fran\\c{c}ois Glineur, Julien M. Hendrickx","submitted_at":"2015-02-19T18:42:42Z","abstract_excerpt":"We show that the exact worst-case performance of fixed-step first-order methods for unconstrained optimization of smooth (possibly strongly) convex functions can be obtained by solving convex programs.\n  Finding the worst-case performance of a black-box first-order method is formulated as an optimization problem over a set of smooth (strongly) convex functions and initial conditions. We develop closed-form necessary and sufficient conditions for smooth (strongly) convex interpolation, which provide a finite representation for those functions. This allows us to reformulate the worst-case perfor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05666","kind":"arxiv","version":6},"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":"1502.05666","created_at":"2026-05-18T01:00:53.985986+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.05666v6","created_at":"2026-05-18T01:00:53.985986+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05666","created_at":"2026-05-18T01:00:53.985986+00:00"},{"alias_kind":"pith_short_12","alias_value":"UZUM2NE5JXEV","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UZUM2NE5JXEVDNGP","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UZUM2NE5","created_at":"2026-05-18T12:29:44.643036+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/UZUM2NE5JXEVDNGPNE7SB3JRYC","json":"https://pith.science/pith/UZUM2NE5JXEVDNGPNE7SB3JRYC.json","graph_json":"https://pith.science/api/pith-number/UZUM2NE5JXEVDNGPNE7SB3JRYC/graph.json","events_json":"https://pith.science/api/pith-number/UZUM2NE5JXEVDNGPNE7SB3JRYC/events.json","paper":"https://pith.science/paper/UZUM2NE5"},"agent_actions":{"view_html":"https://pith.science/pith/UZUM2NE5JXEVDNGPNE7SB3JRYC","download_json":"https://pith.science/pith/UZUM2NE5JXEVDNGPNE7SB3JRYC.json","view_paper":"https://pith.science/paper/UZUM2NE5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.05666&json=true","fetch_graph":"https://pith.science/api/pith-number/UZUM2NE5JXEVDNGPNE7SB3JRYC/graph.json","fetch_events":"https://pith.science/api/pith-number/UZUM2NE5JXEVDNGPNE7SB3JRYC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UZUM2NE5JXEVDNGPNE7SB3JRYC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UZUM2NE5JXEVDNGPNE7SB3JRYC/action/storage_attestation","attest_author":"https://pith.science/pith/UZUM2NE5JXEVDNGPNE7SB3JRYC/action/author_attestation","sign_citation":"https://pith.science/pith/UZUM2NE5JXEVDNGPNE7SB3JRYC/action/citation_signature","submit_replication":"https://pith.science/pith/UZUM2NE5JXEVDNGPNE7SB3JRYC/action/replication_record"}},"created_at":"2026-05-18T01:00:53.985986+00:00","updated_at":"2026-05-18T01:00:53.985986+00:00"}