Cover Image

Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lan, Guanghui, Ouyang, Yuyuan, Zhang, Zhe
Format:	Preprint
Published:	2023
Subjects:	Optimization and Control Computation
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Projected gradient methods for nonconvex and stochastic smooth optimization: new complexities and auto-conditioned stepsizes
by: Lan, Guanghui, et al.
Published: (2024)

Randomized gradient-free methods in convex optimization
by: Gasnikov, Alexander, et al.
Published: (2022)

A simple uniformly optimal method without line search for convex optimization
by: Li, Tianjiao, et al.
Published: (2023)

Universal and Parameter-free Gradient Sliding for Composite Optimization
by: Wu, Yan, et al.
Published: (2026)

Simple linesearch-free first-order methods for nonconvex optimization
by: Yagishita, Shotaro, et al.
Published: (2025)

Universal nonmonotone line search method for nonconvex multiobjective optimization problems with convex constraints
by: Pinheiro, Maria Eduarda, et al.
Published: (2024)

Nearly Optimal $L_p$ Risk Minimization
by: Jia, Zhichao, et al.
Published: (2024)

Regularized methods via cubic model subspace minimization for nonconvex optimization
by: Bellavia, Stefania, et al.
Published: (2023)

A consensus-based optimization method for nonsmooth nonconvex programs with approximated gradient descent scheme
by: Wei, Jiazhen, et al.
Published: (2025)

Auto-conditioned primal-dual hybrid gradient method and alternating direction method of multipliers
by: Lan, Guanghui, et al.
Published: (2024)

Solving Convex Smooth Function Constrained Optimization Is Almost As Easy As Unconstrained Optimization
by: Zhang, Zhe, et al.
Published: (2022)

Stochastic smoothing accelerated gradient method for general constrained nonsmooth convex composite optimization
by: Wang, Ruyu, et al.
Published: (2023)

Adaptive directional decomposition methods for nonconvex constrained optimization
by: Shi, Qiankun, et al.
Published: (2025)

Uniformly Optimal and Parameter-free First-order Methods for Convex and Function-constrained Optimization
by: Deng, Qi, et al.
Published: (2024)

On second-order weak sharp minima of general nonconvex set-constrained optimization problems
by: Ma, Xiaoxiao, et al.
Published: (2025)

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

An interior proximal gradient method for nonconvex optimization
by: De Marchi, Alberto, et al.
Published: (2022)

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

Subgradient sampling for nonsmooth nonconvex minimization
by: Bolte, Jérôme, et al.
Published: (2022)

A unified framework for inexact adaptive stepsizes in the gradient methods, the conjugate gradient methods and the quasi-Newton methods for strictly convex quadratic optimization
by: Liu, Zexian
Published: (2026)

General framework for online-to-nonconvex conversion: Schedule-free SGD is also effective for nonconvex optimization
by: Ahn, Kwangjun, et al.
Published: (2024)

Complexity of a linearized augmented Lagrangian method for nonconvex minimization with nonlinear equality constraints
by: Bourkhissi, Lahcen El, et al.
Published: (2023)

Block majorization-minimization with diminishing radius for constrained nonsmooth nonconvex optimization
by: Lyu, Hanbaek, et al.
Published: (2020)

Parameter-free proximal bundle methods with adaptive stepsizes for hybrid convex composite optimization problems
by: Monteiro, Renato D. C., et al.
Published: (2024)

An accelerated gradient method with adaptive restart for convex multiobjective optimization problems
by: Luo, Hao, et al.
Published: (2025)

An inexact $q$-order regularized proximal Newton method for nonconvex composite optimization
by: Liu, Ruyu, et al.
Published: (2023)

Active-set Newton-MR methods for nonconvex optimization problems with bound constraints
by: Birgin, Ernesto G., et al.
Published: (2025)

Certifying optimality in nonconvex robust PCA
by: Gong, Pinxi, et al.
Published: (2026)

A theory on the absence of spurious solutions for nonconvex and nonsmooth optimization
by: Josz, Cedric, et al.
Published: (2018)

On the construction of a gradient method of quadratic optimization, optimal from the point of view of minimizing the distance to the exact solution
by: Pletnev, N. V.
Published: (2025)

Exact worst-case convergence rates of gradient descent: a complete analysis for all constant stepsizes over nonconvex and convex functions
by: Rotaru, Teodor, et al.
Published: (2024)

An implementable proximal-type method for computing critical points to minimization problems with a nonsmooth and nonconvex constraint
by: Sempere, Gregorio M., et al.
Published: (2024)

The inexact power augmented Lagrangian method for constrained nonconvex optimization
by: Bodard, Alexander, et al.
Published: (2024)

Extended alternating structure-adapted proximal gradient algorithm for nonconvex nonsmooth problems
by: Gao, Ying, et al.
Published: (2024)

Newton and interior-point methods for (constrained) nonconvex-nonconcave minmax optimization with stability and instability guarantees
by: Chinchilla, Raphael, et al.
Published: (2022)

An accelerated proximal bundle method for convex optimization
by: Liao, Feng-Yi, et al.
Published: (2025)

Convergence analysis of linearized $\ell_q$ penalty methods for nonconvex optimization with nonlinear equality constraints
by: Bourkhissi, Lahcen El, et al.
Published: (2025)

Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization
by: Bodard, Alexander, et al.
Published: (2025)

Higher-order tensor methods for minimizing difference of convex functions
by: Necoara, Ion
Published: (2024)

Newton-CG methods for nonconvex unconstrained optimization with Hölder continuous Hessian
by: He, Chuan, et al.
Published: (2023)