Cover Image

Relaxed Proximal Point Algorithm: Tight Complexity Bounds and Acceleration without Momentum

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Wang, Bofan, Ma, Shiqian, Yang, Junfeng, Zhou, Danqing
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Simple Adaptive Proximal Gradient Method for Nonconvex Optimization
by: Ye, Zilong, et al.
Published: (2025)

AdaBB: Adaptive Barzilai-Borwein Method for Convex Optimization
by: Zhou, Danqing, et al.
Published: (2024)

S$^3$LDBO: A Snapshot Single-Loop Algorithm for Decentralized Bilevel Optimization
by: Yin, Chao, et al.
Published: (2026)

An Accelerated Proximal Bundle Method with Momentum
by: Zheng, Zhuoqing, et al.
Published: (2026)

A New Inexact Manifold Proximal Linear Algorithm with Adaptive Stopping Criteria
by: Zheng, Zhong, et al.
Published: (2025)

On the Convergence of Constrained Gradient Method
by: Zhou, Danqing, et al.
Published: (2025)

An Adaptive and Parameter-Free Nesterov's Accelerated Gradient Method for Convex Optimization
by: Suh, Jaewook J., et al.
Published: (2025)

Anisotropic Proximal Point Algorithm
by: Laude, Emanuel, et al.
Published: (2023)

A Single-Loop Algorithm for Decentralized Bilevel Optimization
by: Dong, Youran, et al.
Published: (2023)

A New Inexact Proximal Linear Algorithm with Adaptive Stopping Criteria for Robust Phase Retrieval
by: Zheng, Zhong, et al.
Published: (2023)

A Tight SDP Relaxation for the Cubic-Quartic Regularization Problem
by: Zhou, Jinling, et al.
Published: (2025)

Tight Analysis of Difference-of-Convex Algorithm (DCA) Improves Convergence Rates for Proximal Gradient Descent
by: Rotaru, Teodor, et al.
Published: (2025)

Inexact Accelerated Proximal Gradient Method Revisit: An Economical Variant via Shadow Points
by: Yang, Lei, et al.
Published: (2025)

Adaptive Algorithms for Robust Phase Retrieval
by: Zheng, Zhong, et al.
Published: (2024)

A Mixing-Accelerated Primal-Dual Proximal Algorithm for Distributed Nonconvex Optimization
by: Ou, Zichong, et al.
Published: (2023)

A Distributed Asynchronous Generalized Momentum Algorithm Without Delay Bounds
by: Pond, Ellie, et al.
Published: (2025)

Tight Lower Bounds and Optimal Algorithms for Stochastic Nonconvex Optimization with Heavy-Tailed Noise
by: Fradin, Adrien, et al.
Published: (2025)

Explicit Convergence Rate of The Proximal Point Algorithm under R-Continuity
by: Le, Ba Khiet, et al.
Published: (2024)

Compressed Momentum-based Single-Point Zeroth-Order Algorithm for Stochastic Distributed Nonconvex Optimization
by: Chen, Linjing, et al.
Published: (2025)

Complexity Lower Bounds of Adaptive Gradient Algorithms for Non-convex Stochastic Optimization under Relaxed Smoothness
by: Crawshaw, Michael, et al.
Published: (2025)

Inexact Proximal Point and Tseng Algorithms with Nonsummable Errors to Solve Monotone Inclusions
by: Le, Ba Khiet, et al.
Published: (2026)

Continuous Relaxation of Discontinuous Shrinkage Operator: Proximal Inclusion and Conversion
by: Yukawa, Masahiro
Published: (2024)

Continuized Nesterov Momentum Achieves the $O(\varepsilon^{-7/4})$ Complexity without Additional Mechanisms
by: Hermant, Julien, et al.
Published: (2026)

On the Acceleration of Proximal Bundle Methods
by: Fersztand, David, et al.
Published: (2025)

Momentum-based Accelerated Algorithm for Distributed Optimization under Sector-Bound Nonlinearity
by: Doostmohammadian, Mohammadreza, et al.
Published: (2025)

A Unified Theory of Stochastic Proximal Point Methods without Smoothness
by: Richtárik, Peter, et al.
Published: (2024)

Tight Bounds for the Maximum Distance Over a Polytope to a Given Point
by: Costandin, Marius, et al.
Published: (2023)

Improved Analysis of Restarted Accelerated Gradient and Augmented Lagrangian Methods via Inexact Proximal Point Frameworks
by: Burns, Matthew X., et al.
Published: (2026)

Tight Bounds on Polynomials and Its Application to Dynamic Optimization Problems
by: Vila, Eduardo M. G., et al.
Published: (2024)

Convergence Rate Analysis for Monotone Accelerated Proximal Gradient Method
by: Wang, Zepeng, et al.
Published: (2025)

Slack More, Predict Better: Proximal Relaxation for Probabilistic Latent Variable Model-based Soft Sensors
by: Zou, Zehua, et al.
Published: (2026)

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles
by: Zhang, Shunzhi, et al.
Published: (2026)

Revisiting Stochastic Gradient Descent for Strongly Convex Objectives: Tight Uniform-in-Time Bounds
by: Chen, Kang, et al.
Published: (2025)

Riemannian Accelerated Zeroth-order Algorithm: Improved Robustness and Lower Query Complexity
by: He, Chang, et al.
Published: (2024)

Constructing Tight Quadratic Relaxations for Global Optimization: II. Underestimating Difference-of-Convex (D.C.) Functions
by: Strahl, William R., et al.
Published: (2024)

Constructing Tight Quadratic Relaxations for Global Optimization: I. Outer-Approximating Twice-Differentiable Convex Functions
by: Strahl, William R., et al.
Published: (2024)

Accelerated Proximal Dogleg Majorization for Sparse Regularized Quadratic Optimization Problem
by: Zhao, Feifei, et al.
Published: (2025)

Riemannian Bilevel Optimization
by: Li, Jiaxiang, et al.
Published: (2024)

Accelerated Proximal Gradient Method with Backtracking for Multiobjective Optimization
by: Huang, Chengzhi, et al.
Published: (2024)

Affine FR: an Effective Facial Reduction Algorithm for Semidefinite Relaxations of Combinatorial Problems
by: Hu, Hao, et al.
Published: (2024)