Cover Image

Relaxed Weak Accelerated Proximal Gradient Method: a Unified Framework for Nesterov's Accelerations

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Li, Hongda, Wang, Xianfu
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control 90C30, 90C25, 65K10 (Primary), 65Y20 (Secondary)
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Proximal-Gradient Method for Constrained Optimization
by: Dai, Yutong, et al.
Published: (2024)

A Proximal-Gradient Method for Solving Regularized Optimization Problems with General Constraints
by: Curtis, Frank E., et al.
Published: (2025)

A Near-Optimal Total Complexity for the Inexact Accelerated Proximal Gradient Method via Quadratic Growth
by: Li, Hongda, et al.
Published: (2026)

The Global R-linear Convergence of Nesterov's Accelerated Gradient Method with Unknown Strongly Convex Parameter
by: Bao, Chenglong, et al.
Published: (2023)

Preconditioned Proximal Gradient Methods with Conjugate Momentum: A Subspace Perspective
by: Chen, Jian, et al.
Published: (2026)

Accelerated Gradient Methods with Gradient Restart: Global Linear Convergence
by: Bao, Chenglong, et al.
Published: (2024)

Parameter-Free Accelerated Quasi-Newton Method for Nonconvex Optimization
by: Marumo, Naoki
Published: (2025)

Randomized Subspace Nesterov Accelerated Gradient
by: Omiya, Gaku, et al.
Published: (2026)

cuHALLaR: A GPU Accelerated Low-Rank Augmented Lagrangian Method for Large-Scale Semidefinite Programming
by: Aguirre, Jacob M., et al.
Published: (2025)

Accelerated-gradient-based generalized Levenberg--Marquardt method with oracle complexity bound and local quadratic convergence
by: Marumo, Naoki, et al.
Published: (2022)

A Flexible Algorithmic Framework for Strictly Convex Quadratic Minimization
by: MacDonald, Liam, et al.
Published: (2025)

On the Relationships among GPU-Accelerated First-Order Methods for Solving Linear Programming
by: Chen, Kaihuang, et al.
Published: (2025)

Fast Optimistic Gradient Descent Ascent (OGDA) method in continuous and discrete time
by: Bot, Radu Ioan, et al.
Published: (2022)

Adaptive Inertial Method
by: Long, Han, et al.
Published: (2025)

Optimization in Theory and Practice
by: Wright, Stephen J.
Published: (2025)

Symplectic Extra-gradient Type Method for Solving General Non-monotone Inclusion Problem
by: Yuan, Ya-xiang, et al.
Published: (2024)

A Unified Zeroth-Order Proximal Newton-Type Framework for Composite Optimization
by: Liu, Zekun, et al.
Published: (2026)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
by: Zhou, Juan, et al.
Published: (2024)

On the convergence of an inertial proximal algorithm with a Tikhonov regularization term
by: László, Szilárd Csaba
Published: (2023)

Nonsmooth Projection-Free Optimization with Functional Constraints
by: Asgari, Kamiar, et al.
Published: (2023)

New Primal-Dual Algorithm for Convex Problems
by: Liu, Shuning, et al.
Published: (2025)

On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation
by: Bollapragada, Raghu, et al.
Published: (2025)

Accelerated primal dual fixed point algorithm
by: Zhu, Ya-Nan
Published: (2025)

Strong Convergence of Relaxed Inertial Inexact Progressive Hedging Algorithm for Multi-stage Stochastic Variational Inequality Problems
by: Chen, Jiaxin, et al.
Published: (2024)

Efficient parameter-free restarted accelerated gradient methods for convex and strongly convex optimization
by: Sujanani, Arnesh, et al.
Published: (2024)

Splitting the Conditional Gradient Algorithm
by: Woodstock, Zev, et al.
Published: (2023)

Strong Convergence of FISTA for Affinely Constrained Convex Quadratic Minimization
by: Bartz, Sedi, et al.
Published: (2026)

A Massively Parallel Interior-Point Method for Arrowhead Linear Programs with Local Linking Structure
by: Kempke, Nils-Christian, et al.
Published: (2024)

Accelerated Proximal Gradient Methods in the affine-quadratic case: Strong convergence and limit identification
by: Moursi, Walaa M., et al.
Published: (2025)

Symplectic Discretization Approach for Developing New Proximal Point Algorithm
by: Yuan, Ya-xiang, et al.
Published: (2023)

Scalable Mean-Variance Portfolio Optimization via Subspace Embeddings and GPU-Friendly Nesterov-Accelerated Projected Gradient
by: Niu, Yi-Shuai, et al.
Published: (2026)

Identification of Active Subfunctions in Finite-Max Minimisation via a Smooth Reformulation
by: Ras, Charl, et al.
Published: (2024)

Parameter-free accelerated gradient descent for nonconvex minimization
by: Marumo, Naoki, et al.
Published: (2022)

Expansions of the Characteristic Polynomial of a Perturbed Positive Semidefinite Matrix and Convergence Analysis of Alternating Projections
by: Ochiai, Hiroyuki, et al.
Published: (2024)

Convergence rate of alternating projection method for the intersection of an affine subspace and the second-order cone
by: Ochiai, Hiroyuki, et al.
Published: (2024)

Analytic Formulas for Alternating Projection Sequences for the Positive Semidefinite Cone and an Application to Convergence Analysis
by: Ochiai, Hiroyuki, et al.
Published: (2024)

HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming
by: Chen, Kaihuang, et al.
Published: (2025)

Entropic Mirror Descent for Linear Systems: Polyak's Stepsize and Implicit Bias
by: Malitsky, Yura, et al.
Published: (2025)

Proximal Gradient Descent Ascent Methods for Nonsmooth Nonconvex-Concave Minimax Problems on Riemannian Manifolds
by: Xie, Xiyuan, et al.
Published: (2025)

Efficient globalization of heavy-ball type methods for unconstrained optimization based on curve searches
by: Donnini, Federica, et al.
Published: (2025)