{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:FUKGUHTPXWDDASMRGDLZ773X2Q","short_pith_number":"pith:FUKGUHTP","schema_version":"1.0","canonical_sha256":"2d146a1e6fbd8630499130d79fff77d43a82ac1d946bf699bda4a08f99e7cb23","source":{"kind":"arxiv","id":"2202.08711","version":1},"attestation_state":"computed","paper":{"title":"The Iterates of the Frank-Wolfe Algorithm May Not Converge","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Cyrille W. Combettes, \\'Edouard Pauwels, J\\'er\\^ome Bolte","submitted_at":"2022-02-17T15:33:04Z","abstract_excerpt":"The Frank-Wolfe algorithm is a popular method for minimizing a smooth convex function $f$ over a compact convex set $\\mathcal{C}$. While many convergence results have been derived in terms of function values, hardly nothing is known about the convergence behavior of the sequence of iterates $(x_t)_{t\\in\\mathbb{N}}$. Under the usual assumptions, we design several counterexamples to the convergence of $(x_t)_{t\\in\\mathbb{N}}$, where $f$ is $d$-time continuously differentiable, $d\\geq2$, and $f(x_t)\\to\\min_\\mathcal{C}f$. Our counterexamples cover the cases of open-loop, closed-loop, and line-sear"},"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":"2202.08711","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-02-17T15:33:04Z","cross_cats_sorted":[],"title_canon_sha256":"ba9d71f364c4e0be3880fa22aaf3597e5f1e9893799db68aa5d878a9c1c2fcd5","abstract_canon_sha256":"10853f591052dc63ad5850b48517743a0627f2dae5be642b56a89df9163fd79d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:57:57.081134Z","signature_b64":"n5BIPX6OnrR9cle9nUmyQ2G/54pJjQrNPI13sIYyij4VmEEx2FwNSpL+I9jSFIFLxpfTI9efeG6bfGQ/sBqfCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d146a1e6fbd8630499130d79fff77d43a82ac1d946bf699bda4a08f99e7cb23","last_reissued_at":"2026-07-05T03:57:57.080599Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:57:57.080599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Iterates of the Frank-Wolfe Algorithm May Not Converge","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Cyrille W. Combettes, \\'Edouard Pauwels, J\\'er\\^ome Bolte","submitted_at":"2022-02-17T15:33:04Z","abstract_excerpt":"The Frank-Wolfe algorithm is a popular method for minimizing a smooth convex function $f$ over a compact convex set $\\mathcal{C}$. While many convergence results have been derived in terms of function values, hardly nothing is known about the convergence behavior of the sequence of iterates $(x_t)_{t\\in\\mathbb{N}}$. Under the usual assumptions, we design several counterexamples to the convergence of $(x_t)_{t\\in\\mathbb{N}}$, where $f$ is $d$-time continuously differentiable, $d\\geq2$, and $f(x_t)\\to\\min_\\mathcal{C}f$. Our counterexamples cover the cases of open-loop, closed-loop, and line-sear"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.08711","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2202.08711/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2202.08711","created_at":"2026-07-05T03:57:57.080664+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.08711v1","created_at":"2026-07-05T03:57:57.080664+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.08711","created_at":"2026-07-05T03:57:57.080664+00:00"},{"alias_kind":"pith_short_12","alias_value":"FUKGUHTPXWDD","created_at":"2026-07-05T03:57:57.080664+00:00"},{"alias_kind":"pith_short_16","alias_value":"FUKGUHTPXWDDASMR","created_at":"2026-07-05T03:57:57.080664+00:00"},{"alias_kind":"pith_short_8","alias_value":"FUKGUHTP","created_at":"2026-07-05T03:57:57.080664+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.08850","citing_title":"Local LMO: Constrained Gradient Optimization via a Local Linear Minimization Oracle","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FUKGUHTPXWDDASMRGDLZ773X2Q","json":"https://pith.science/pith/FUKGUHTPXWDDASMRGDLZ773X2Q.json","graph_json":"https://pith.science/api/pith-number/FUKGUHTPXWDDASMRGDLZ773X2Q/graph.json","events_json":"https://pith.science/api/pith-number/FUKGUHTPXWDDASMRGDLZ773X2Q/events.json","paper":"https://pith.science/paper/FUKGUHTP"},"agent_actions":{"view_html":"https://pith.science/pith/FUKGUHTPXWDDASMRGDLZ773X2Q","download_json":"https://pith.science/pith/FUKGUHTPXWDDASMRGDLZ773X2Q.json","view_paper":"https://pith.science/paper/FUKGUHTP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.08711&json=true","fetch_graph":"https://pith.science/api/pith-number/FUKGUHTPXWDDASMRGDLZ773X2Q/graph.json","fetch_events":"https://pith.science/api/pith-number/FUKGUHTPXWDDASMRGDLZ773X2Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FUKGUHTPXWDDASMRGDLZ773X2Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FUKGUHTPXWDDASMRGDLZ773X2Q/action/storage_attestation","attest_author":"https://pith.science/pith/FUKGUHTPXWDDASMRGDLZ773X2Q/action/author_attestation","sign_citation":"https://pith.science/pith/FUKGUHTPXWDDASMRGDLZ773X2Q/action/citation_signature","submit_replication":"https://pith.science/pith/FUKGUHTPXWDDASMRGDLZ773X2Q/action/replication_record"}},"created_at":"2026-07-05T03:57:57.080664+00:00","updated_at":"2026-07-05T03:57:57.080664+00:00"}