{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QHSUX3AQLCCB3AI446NJIA5Q7C","short_pith_number":"pith:QHSUX3AQ","schema_version":"1.0","canonical_sha256":"81e54bec1058841d811ce79a9403b0f8b07365d22569d8ff137eb20d6fb88546","source":{"kind":"arxiv","id":"1803.08832","version":2},"attestation_state":"computed","paper":{"title":"Golden Ratio Algorithms for Variational Inequalities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.OC","authors_text":"Yura Malitsky","submitted_at":"2018-03-23T15:21:16Z","abstract_excerpt":"The paper presents a fully explicit algorithm for monotone variational inequalities. The method uses variable stepsizes that are computed using two previous iterates as an approximation of the local Lipschitz constant without running a linesearch. Thus, each iteration of the method requires only one evaluation of a monotone operator $F$ and a proximal mapping $g$. The operator $F$ need not be Lipschitz-continuous, which also makes the algorithm interesting in the area of composite minimization where one cannot use the descent lemma. The method exhibits an ergodic $O(1/k)$ convergence rate and "},"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":"1803.08832","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-23T15:21:16Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"180b07f2612fd74cbd4bdfa7766f2d1e77692a2f864c20cb0e9a042ffde80421","abstract_canon_sha256":"f1a77ffa8c87cc70d1b5f6ff52efc6caa716e092791d30a749da0eb7f5deba86"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:15.548521Z","signature_b64":"28pSxzlPHswu4hLwYZVl01yE7kT8QEl3hJm6c6Opk3SL3bhXktQrgirmbjOoVLWpA/+b7NshZjqxZ4UEh10tDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81e54bec1058841d811ce79a9403b0f8b07365d22569d8ff137eb20d6fb88546","last_reissued_at":"2026-05-17T23:45:15.547789Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:15.547789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Golden Ratio Algorithms for Variational Inequalities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.OC","authors_text":"Yura Malitsky","submitted_at":"2018-03-23T15:21:16Z","abstract_excerpt":"The paper presents a fully explicit algorithm for monotone variational inequalities. The method uses variable stepsizes that are computed using two previous iterates as an approximation of the local Lipschitz constant without running a linesearch. Thus, each iteration of the method requires only one evaluation of a monotone operator $F$ and a proximal mapping $g$. The operator $F$ need not be Lipschitz-continuous, which also makes the algorithm interesting in the area of composite minimization where one cannot use the descent lemma. The method exhibits an ergodic $O(1/k)$ convergence rate and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.08832","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":"1803.08832","created_at":"2026-05-17T23:45:15.547902+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.08832v2","created_at":"2026-05-17T23:45:15.547902+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.08832","created_at":"2026-05-17T23:45:15.547902+00:00"},{"alias_kind":"pith_short_12","alias_value":"QHSUX3AQLCCB","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"QHSUX3AQLCCB3AI4","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"QHSUX3AQ","created_at":"2026-05-18T12:32:46.962924+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.04013","citing_title":"Modified golden ratio algorithms for solving equilibrium problems","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QHSUX3AQLCCB3AI446NJIA5Q7C","json":"https://pith.science/pith/QHSUX3AQLCCB3AI446NJIA5Q7C.json","graph_json":"https://pith.science/api/pith-number/QHSUX3AQLCCB3AI446NJIA5Q7C/graph.json","events_json":"https://pith.science/api/pith-number/QHSUX3AQLCCB3AI446NJIA5Q7C/events.json","paper":"https://pith.science/paper/QHSUX3AQ"},"agent_actions":{"view_html":"https://pith.science/pith/QHSUX3AQLCCB3AI446NJIA5Q7C","download_json":"https://pith.science/pith/QHSUX3AQLCCB3AI446NJIA5Q7C.json","view_paper":"https://pith.science/paper/QHSUX3AQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.08832&json=true","fetch_graph":"https://pith.science/api/pith-number/QHSUX3AQLCCB3AI446NJIA5Q7C/graph.json","fetch_events":"https://pith.science/api/pith-number/QHSUX3AQLCCB3AI446NJIA5Q7C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QHSUX3AQLCCB3AI446NJIA5Q7C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QHSUX3AQLCCB3AI446NJIA5Q7C/action/storage_attestation","attest_author":"https://pith.science/pith/QHSUX3AQLCCB3AI446NJIA5Q7C/action/author_attestation","sign_citation":"https://pith.science/pith/QHSUX3AQLCCB3AI446NJIA5Q7C/action/citation_signature","submit_replication":"https://pith.science/pith/QHSUX3AQLCCB3AI446NJIA5Q7C/action/replication_record"}},"created_at":"2026-05-17T23:45:15.547902+00:00","updated_at":"2026-05-17T23:45:15.547902+00:00"}