Copertina

Efficient parameter-free restarted accelerated gradient methods for convex and strongly convex optimization

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Sujanani, Arnesh, Monteiro, Renato D. C.
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control 90C30, 65K10, 90C25, 90C60
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

A low-rank augmented Lagrangian method for large-scale semidefinite programming based on a hybrid convex-nonconvex approach
di: Monteiro, Renato D. C., et al.
Pubblicazione: (2024)

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

A User Manual for cuHALLaR: A GPU Accelerated Low-Rank Semidefinite Programming Solver
di: Aguirre, Jacob, et al.
Pubblicazione: (2025)

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

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

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

MGProx: A nonsmooth multigrid proximal gradient method with adaptive restriction for strongly convex optimization
di: Ang, Andersen, et al.
Pubblicazione: (2023)

Complexity-optimal and parameter-free first-order methods for finding stationary points of composite optimization problems
di: Kong, Weiwei
Pubblicazione: (2022)

Augmented Lagrangian methods for fully convex composite optimization
di: De Marchi, Alberto, et al.
Pubblicazione: (2025)

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

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

Nonlinear conjugate gradient for smooth convex functions
di: Karimi, Sahar, et al.
Pubblicazione: (2021)

Adaptive Inertial Method
di: Long, Han, et al.
Pubblicazione: (2025)

Convergence of iterates and improved rates for accelerated augmented Lagrangian methods for linearly constrained convex optimization
di: He, Xin, et al.
Pubblicazione: (2026)

A feasible smoothing accelerated projected gradient method for nonsmooth convex optimization
di: Nishioka, Akatsuki, et al.
Pubblicazione: (2023)

A Busemann hybrid projection-proximal point algorithm for optimization problems on Hadamard manifolds
di: Millán, R. Díaz, et al.
Pubblicazione: (2026)

Nesterov's accelerated gradient for unbounded convex functions finds the minimum-norm point in the dual space
di: Sakabe, Keiya
Pubblicazione: (2026)

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

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

Adaptive proximal gradient methods are universal without approximation
di: Oikonomidis, Konstantinos A., et al.
Pubblicazione: (2024)

Forward-Backward algorithms for weakly convex problems
di: Bednarczuk, Ewa, et al.
Pubblicazione: (2023)

Extragradient method with feasible inexact projection to variational inequality problem
di: Millán, R. Díaz, et al.
Pubblicazione: (2023)

Warm-starting outer approximation for parametrized convex MINLP
di: Tamm, Erik, et al.
Pubblicazione: (2025)

Splitting the Conditional Gradient Algorithm
di: Woodstock, Zev, et al.
Pubblicazione: (2023)

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

Riemannian Adaptive Regularized Newton Methods with Hölder Continuous Hessians
di: Zhang, Chenyu, et al.
Pubblicazione: (2023)

Heavy Ball Momentum for Non-Strongly Convex Optimization
di: Aujol, Jean-François, et al.
Pubblicazione: (2024)

Solving nonconvex optimization problems via a second order dynamical system with unbounded damping
di: László, Szilárd Csaba
Pubblicazione: (2025)

A distributed Douglas-Rachford splitting method for solving linear constrained multi-block weakly convex problems
di: Hu, Leyu, et al.
Pubblicazione: (2024)

Solving convex optimization problems via a second order dynamical system with implicit Hessian damping and Tikhonov regularization
di: László, Szilárd Csaba
Pubblicazione: (2024)

An interior point method for nonlinear constrained derivative-free optimization
di: Brilli, Andrea, et al.
Pubblicazione: (2021)

Binno: A 1st-order method for Bi-level Nonconvex Nonsmooth Optimization for Matrix Factorizations
di: Selicato, Laura, et al.
Pubblicazione: (2025)

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

Stochastic optimization over proximally smooth sets
di: Davis, Damek, et al.
Pubblicazione: (2020)

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

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

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

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

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

Parallel block coordinate descent methods with identification strategies
di: Lopes, Ronaldo, et al.
Pubblicazione: (2025)