arXiv (All)
open access
An Adaptive Symplectic Proximal Point Algorithm: Faster Convergence and Improved Numerical Performance
The proximal point algorithm (PPA) stands as a fundamental approach for solving monotone inclusion problems. Notably, several key convex optimization algorithms have been proven to be specific instances of PPA. Given the importance of the PPA, there has been growing interest in developing its accele
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- An inertial extrapolation method for convex simple bilevel optimization#196252
- Minimization of Keane’s Bump Function by the Repulsive Particle Swarm and the Differential Evolution Methods#1275303
- Optimal Stochastic Bilevel Optimization with First-Order Oracles#1157114
- Adaptive Bregman Proximal Stochastic Gradient with a Stabilized Barzilai--Borwein Step Size#447950
- Nonasymptotic Convergence Rates for Plug-and-Play Methods With MMSE Denoisers#1117270
Record · ID 1187641
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive