Cover Image

Adaptive proximal gradient methods are universal without approximation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Oikonomidis, Konstantinos A., Laude, Emanuel, Latafat, Puya, Themelis, Andreas, Patrinos, Panagiotis
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control Machine Learning 65K05, 90C06, 90C25, 90C30, 90C47
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the convergence of adaptive first order methods: proximal gradient and alternating minimization algorithms
by: Latafat, Puya, et al.
Published: (2023)

Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient
by: Latafat, Puya, et al.
Published: (2023)

On the convergence of proximal gradient methods for convex simple bilevel optimization
by: Latafat, Puya, et al.
Published: (2023)

Linesearch-free adaptive Bregman proximal gradient for convex minimization without relative smoothness
by: Ou, Hongjia, et al.
Published: (2025)

Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
by: Latafat, Puya, et al.
Published: (2019)

Bregman Finito/MISO for nonconvex regularized finite sum minimization without Lipschitz gradient continuity
by: Latafat, Puya, et al.
Published: (2021)

SPIRAL: A superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization
by: Behmandpoor, Pourya, et al.
Published: (2022)

A Lasry-Lions envelope approach for mathematical programs with complementarity constraints
by: Wang, Jia, et al.
Published: (2025)

Safeguarding adaptive methods: global convergence of Barzilai-Borwein and other stepsize choices
by: Ou, Hongjia, et al.
Published: (2024)

A new envelope function for nonsmooth DC optimization
by: Themelis, Andreas, et al.
Published: (2020)

Randomized block proximal method with locally Lipschitz continuous gradient
by: Pérez-Aros, Pedro, et al.
Published: (2025)

Line-search and Adaptive Step Sizes for Nonconvex-strongly-concave Minimax Optimization
by: Ma, Bohao, et al.
Published: (2026)

Active set identification and rapid convergence for degenerate primal-dual problems
by: Díaz, Mateo, et al.
Published: (2026)

Douglas-Rachford splitting and ADMM for nonconvex optimization: Accelerated and Newton-type linesearch algorithms
by: Themelis, Andreas, et al.
Published: (2020)

A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima
by: Ahookhosh, Masoud, et al.
Published: (2019)

Fast Frank--Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions
by: Takahashi, Shota, et al.
Published: (2025)

Multivariate approximation by polynomial and generalised rational functions
by: Millán, R. Díaz, et al.
Published: (2021)

A Single-Loop Stochastic Proximal Quasi-Newton Method for Large-Scale Nonsmooth Convex Optimization
by: Song, Yongcun, 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)

Bregman Stochastic Proximal Point Algorithm with Variance Reduction
by: Traoré, Cheik, et al.
Published: (2025)

Splitting Algorithms for Distributionally Robust Optimization
by: Briceño-Arias, Luis, et al.
Published: (2024)

PANOC-lite: A simpler and more efficient algorithm for composite minimization
by: Bodard, Alexander, et al.
Published: (2026)

Fast projection onto the top-k-sum constraint
by: Pan, Jianting, et al.
Published: (2025)

A non-monotone trust-region method with noisy oracles and additional sampling
by: Krejic, Natasa, et al.
Published: (2023)

Simplex Frank-Wolfe: Linear Convergence and Its Numerical Efficiency for Convex Optimization over Polytopes
by: Wang, Haoning, et al.
Published: (2025)

A structured L-BFGS method and its application to inverse problems
by: Mannel, Florian, et al.
Published: (2023)

A structured L-BFGS method with diagonal scaling and its application to image registration
by: Mannel, Florian, et al.
Published: (2024)

Optimality Conditions and Numerical Algorithms for a Class of Minimax Bilevel Optimization Problems
by: Hu, Yaling, et al.
Published: (2026)

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

A proximal augmented Lagrangian method for nonconvex optimization with equality and inequality constraints
by: Adeoye, Adeyemi D., et al.
Published: (2025)

A globalization of L-BFGS and the Barzilai-Borwein method for nonconvex unconstrained optimization
by: Mannel, Florian
Published: (2024)

Anderson Accelerated Primal-Dual Hybrid Gradient for solving LP
by: Zhou, Yingxin, et al.
Published: (2025)

Oracle complexities of augmented Lagrangian methods for nonsmooth manifold optimization
by: Deng, Kangkang, et al.
Published: (2024)

Monomial barrier functions for the box-constrained convex optimization problems
by: Fayed, Hatem
Published: (2024)

Difference of Convex (DC) approach for neural network approximation with uniform loss function
by: Peiris, Vinesha, et al.
Published: (2026)

Hybrid optimal control with mixed-integer Lagrangian methods
by: Nikitina, Viktoriya, et al.
Published: (2024)

Convergence analysis of a primal-dual optimization-by-continuation algorithm
by: Loris, Ignace, et al.
Published: (2023)

HPR-LP: An implementation of an HPR method for solving linear programming
by: Chen, Kaihuang, et al.
Published: (2024)

Affordable mixed-integer Lagrangian methods: optimality conditions and convergence analysis
by: De Marchi, Alberto
Published: (2024)

A symmetric primal-dual algorithmic framework for saddle point problems
by: He, Hongjin, et al.
Published: (2022)