{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SNEM3DPF5KK2XVGUKVKVMFZKYA","short_pith_number":"pith:SNEM3DPF","schema_version":"1.0","canonical_sha256":"9348cd8de5ea95abd4d4555556172ac02f885cc8f08b84c10fab01afeeaa715b","source":{"kind":"arxiv","id":"1609.08177","version":5},"attestation_state":"computed","paper":{"title":"Extragradient Method in Optimization: Convergence and Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bruce W. Suter, Edouard Pauwels, Emile Richard, Trong Phong Nguyen","submitted_at":"2016-09-26T20:18:17Z","abstract_excerpt":"We consider the extragradient method to minimize the sum of two functions, the first one being smooth and the second being convex. Under the Kurdyka-Lojasiewicz assumption, we prove that the sequence produced by the extragradient method converges to a critical point of the problem and has finite length. The analysis is extended to the case when both functions are convex. We provide, in this case, a sublinear convergence rate, as for gradient-based methods. Furthermore, we show that the recent small-prox complexity result can be applied to this method. Considering the extragradient method is an"},"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":"1609.08177","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-26T20:18:17Z","cross_cats_sorted":[],"title_canon_sha256":"e914917391c81150737cbff5cf1ddd5b939ea721a8a949a9e3108fa3f66db48f","abstract_canon_sha256":"a03def6b2605a9384ac9a7506d5effca42d7f9f4456f0667ee8dbdffbe528310"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:07.238586Z","signature_b64":"FfyqCfXbKQU/B0E71UJxkB7N/HT6AIs1/gPQtAoHTYwYSaD45D5mSXBig8VtPp46RqkaBHd9YoOVIwX707MQCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9348cd8de5ea95abd4d4555556172ac02f885cc8f08b84c10fab01afeeaa715b","last_reissued_at":"2026-05-18T00:28:07.237925Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:07.237925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extragradient Method in Optimization: Convergence and Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bruce W. Suter, Edouard Pauwels, Emile Richard, Trong Phong Nguyen","submitted_at":"2016-09-26T20:18:17Z","abstract_excerpt":"We consider the extragradient method to minimize the sum of two functions, the first one being smooth and the second being convex. Under the Kurdyka-Lojasiewicz assumption, we prove that the sequence produced by the extragradient method converges to a critical point of the problem and has finite length. The analysis is extended to the case when both functions are convex. We provide, in this case, a sublinear convergence rate, as for gradient-based methods. Furthermore, we show that the recent small-prox complexity result can be applied to this method. Considering the extragradient method is an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.08177","kind":"arxiv","version":5},"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":"1609.08177","created_at":"2026-05-18T00:28:07.238016+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.08177v5","created_at":"2026-05-18T00:28:07.238016+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08177","created_at":"2026-05-18T00:28:07.238016+00:00"},{"alias_kind":"pith_short_12","alias_value":"SNEM3DPF5KK2","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SNEM3DPF5KK2XVGU","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SNEM3DPF","created_at":"2026-05-18T12:30:44.179134+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/SNEM3DPF5KK2XVGUKVKVMFZKYA","json":"https://pith.science/pith/SNEM3DPF5KK2XVGUKVKVMFZKYA.json","graph_json":"https://pith.science/api/pith-number/SNEM3DPF5KK2XVGUKVKVMFZKYA/graph.json","events_json":"https://pith.science/api/pith-number/SNEM3DPF5KK2XVGUKVKVMFZKYA/events.json","paper":"https://pith.science/paper/SNEM3DPF"},"agent_actions":{"view_html":"https://pith.science/pith/SNEM3DPF5KK2XVGUKVKVMFZKYA","download_json":"https://pith.science/pith/SNEM3DPF5KK2XVGUKVKVMFZKYA.json","view_paper":"https://pith.science/paper/SNEM3DPF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.08177&json=true","fetch_graph":"https://pith.science/api/pith-number/SNEM3DPF5KK2XVGUKVKVMFZKYA/graph.json","fetch_events":"https://pith.science/api/pith-number/SNEM3DPF5KK2XVGUKVKVMFZKYA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SNEM3DPF5KK2XVGUKVKVMFZKYA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SNEM3DPF5KK2XVGUKVKVMFZKYA/action/storage_attestation","attest_author":"https://pith.science/pith/SNEM3DPF5KK2XVGUKVKVMFZKYA/action/author_attestation","sign_citation":"https://pith.science/pith/SNEM3DPF5KK2XVGUKVKVMFZKYA/action/citation_signature","submit_replication":"https://pith.science/pith/SNEM3DPF5KK2XVGUKVKVMFZKYA/action/replication_record"}},"created_at":"2026-05-18T00:28:07.238016+00:00","updated_at":"2026-05-18T00:28:07.238016+00:00"}