{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:O57XKA5J4UP2YU3XWGUUQQA4RB","short_pith_number":"pith:O57XKA5J","schema_version":"1.0","canonical_sha256":"777f7503a9e51fac5377b1a948401c884e65ea7ba0c25b943a54a8c0469a9bef","source":{"kind":"arxiv","id":"2410.08890","version":1},"attestation_state":"computed","paper":{"title":"Relaxed Proximal Point Algorithm: Tight Complexity Bounds and Acceleration without Momentum","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bofan Wang, Danqing Zhou, Junfeng Yang, Shiqian Ma","submitted_at":"2024-10-11T15:07:32Z","abstract_excerpt":"In this paper, we focus on the relaxed proximal point algorithm (RPPA) for solving convex (possibly nonsmooth) optimization problems. We conduct a comprehensive study on three types of relaxation schedules: (i) constant schedule with relaxation parameter $\\alpha_k\\equiv \\alpha \\in (0, \\sqrt{2}]$, (ii) the dynamic schedule put forward by Teboulle and Vaisbourd [TV23], and (iii) the silver stepsize schedule proposed by Altschuler and Parrilo [AP23b]. The latter two schedules were initially investigated for the gradient descent (GD) method and are extended to the RPPA in this paper. For type (i),"},"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":"2410.08890","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-10-11T15:07:32Z","cross_cats_sorted":[],"title_canon_sha256":"4462a5205127c72264ca7bd146c2cff8858aba1025676d962b85cc43ab415234","abstract_canon_sha256":"95ca8fdfe633d2bc0452bb74f6dafa29e863a848511de58f489339872a5cbb53"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:19:19.234535Z","signature_b64":"7vpmUH0e6srftnvbvjok3ilfoBL2fzMCVPTRzYeHv0Y9l1M0AkQATc3wP4Ykdrh4Nn712FJKpyDJbgk7hJe4BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"777f7503a9e51fac5377b1a948401c884e65ea7ba0c25b943a54a8c0469a9bef","last_reissued_at":"2026-07-05T09:19:19.234117Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:19:19.234117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Relaxed Proximal Point Algorithm: Tight Complexity Bounds and Acceleration without Momentum","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bofan Wang, Danqing Zhou, Junfeng Yang, Shiqian Ma","submitted_at":"2024-10-11T15:07:32Z","abstract_excerpt":"In this paper, we focus on the relaxed proximal point algorithm (RPPA) for solving convex (possibly nonsmooth) optimization problems. We conduct a comprehensive study on three types of relaxation schedules: (i) constant schedule with relaxation parameter $\\alpha_k\\equiv \\alpha \\in (0, \\sqrt{2}]$, (ii) the dynamic schedule put forward by Teboulle and Vaisbourd [TV23], and (iii) the silver stepsize schedule proposed by Altschuler and Parrilo [AP23b]. The latter two schedules were initially investigated for the gradient descent (GD) method and are extended to the RPPA in this paper. For type (i),"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.08890","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/2410.08890/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":"2410.08890","created_at":"2026-07-05T09:19:19.234170+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.08890v1","created_at":"2026-07-05T09:19:19.234170+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.08890","created_at":"2026-07-05T09:19:19.234170+00:00"},{"alias_kind":"pith_short_12","alias_value":"O57XKA5J4UP2","created_at":"2026-07-05T09:19:19.234170+00:00"},{"alias_kind":"pith_short_16","alias_value":"O57XKA5J4UP2YU3X","created_at":"2026-07-05T09:19:19.234170+00:00"},{"alias_kind":"pith_short_8","alias_value":"O57XKA5J","created_at":"2026-07-05T09:19:19.234170+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.06676","citing_title":"On the convergence rate of the Douglas-Rachford splitting algorithm","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O57XKA5J4UP2YU3XWGUUQQA4RB","json":"https://pith.science/pith/O57XKA5J4UP2YU3XWGUUQQA4RB.json","graph_json":"https://pith.science/api/pith-number/O57XKA5J4UP2YU3XWGUUQQA4RB/graph.json","events_json":"https://pith.science/api/pith-number/O57XKA5J4UP2YU3XWGUUQQA4RB/events.json","paper":"https://pith.science/paper/O57XKA5J"},"agent_actions":{"view_html":"https://pith.science/pith/O57XKA5J4UP2YU3XWGUUQQA4RB","download_json":"https://pith.science/pith/O57XKA5J4UP2YU3XWGUUQQA4RB.json","view_paper":"https://pith.science/paper/O57XKA5J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.08890&json=true","fetch_graph":"https://pith.science/api/pith-number/O57XKA5J4UP2YU3XWGUUQQA4RB/graph.json","fetch_events":"https://pith.science/api/pith-number/O57XKA5J4UP2YU3XWGUUQQA4RB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O57XKA5J4UP2YU3XWGUUQQA4RB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O57XKA5J4UP2YU3XWGUUQQA4RB/action/storage_attestation","attest_author":"https://pith.science/pith/O57XKA5J4UP2YU3XWGUUQQA4RB/action/author_attestation","sign_citation":"https://pith.science/pith/O57XKA5J4UP2YU3XWGUUQQA4RB/action/citation_signature","submit_replication":"https://pith.science/pith/O57XKA5J4UP2YU3XWGUUQQA4RB/action/replication_record"}},"created_at":"2026-07-05T09:19:19.234170+00:00","updated_at":"2026-07-05T09:19:19.234170+00:00"}