An Adaptive Symplectic Proximal Point Algorithm: Faster Convergence and Improved Numerical Performance

Abstract

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 accelerated variants. However, for some specific cases, the PPA converges faster than the accelerated PPAs. In this paper, we mainly study an adaptive version of symplectic accelerated PPA, called adaptive symplectic proximal point algorithm (ASPPA). We first prove that the convergence rate of ASPPA with respect to the square norm term is O(1/k²), which is the same as the convergence rate of some accelerated PPAs. Also, we show that ASPPA exists exponential convergence rate when solving strongly monotone inclusion problem. Our numerical experiments indicate that the performance of ASPPA is very good.

Numerical approximation of nonlinear fractional dynamical systems for coastal wave modeling: rigorous analysis of convergence and computational efficiency
Rabeb Sidaoui, Faten H. Damag, Amin Saif +1
Scientific Reports16 Oct 2026Peer-reviewedCC BY-NC-ND 4.0Full textGeneral mathematicsCrossref
Exponential Convergence of the Sinkhorn Algorithm for the Schrödinger Bridge with Regime Switching
Katharina Eichinger, Anna Kazeykina, Zhenjie Ren +1
HAL21 Jul 2026PreprintLicence not statedGeneral mathematicsHAL
An energy-decreasing algorithm for the finite element approximation of ferronematic equilibrium states and its numerical realization
Alexandre Ern, Ruma R. Maity
HAL11 May 2026PreprintCC BY-NC-ND 4.0Full textNumerical analysis & scientific computingHALarXiv
Reducing the Lipschitz Constant in Tseng Algorithm and the Convergence Analysis
Ba Khiet Le, Minh Thuan Tran, Thi Thanh Tien Pham +1
arXiv1 Sep 2026PreprintCC BY 4.0Full textOptimisation & controlarXiv
Convergence and error analysis for numerical approximations of stochastic Leray-Lions equations
Ngan Le, Huateng Zhu
arXiv4 Oct 2026PreprintarXiv licenceFull textNumerical analysis & scientific computing ProbabilityarXiv

Cite

BibTeX RIS

BibTeX

@misc{zhang2026adaptive,
  title = {{An Adaptive Symplectic Proximal Point Algorithm: Faster Convergence and Improved Numerical Performance}},
  author = {Yi Zhang},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.02963},
  eprint = {2610.02963},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.02963},
  note = {CC BY 4.0},
}

RIS

TY  - UNPB
TI  - An Adaptive Symplectic Proximal Point Algorithm: Faster Convergence and Improved Numerical Performance
AU  - Yi Zhang
PY  - 2026
DA  - 2026/10/02
PB  - arXiv
DO  - 10.48550/arxiv.2610.02963
UR  - https://arxiv.org/abs/2610.02963
AB  - 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 accelerated variants. However, for some specific cases, the PPA converges faster than the accelerated PPAs. In this paper, we mainly study an adaptive version of symplectic accelerated PPA, called adaptive symplectic proximal point algorithm (ASPPA). We first prove that the convergence rate of ASPPA with respect to the square norm term is O(1/k^2), which is the same as the convergence rate of some accelerated PPAs. Also, we show that ASPPA exists exponential convergence rate when solving strongly monotone inclusion problem. Our numerical experiments indicate that the performance of ASPPA is very good.
ER  -

Abstract

Related

Cite