Cover Image

Simple linesearch-free first-order methods for nonconvex optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Yagishita, Shotaro, Ito, Masaru
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Convergence of linesearch-based generalized conditional gradient methods without smoothness assumptions
by: Yagishita, Shotaro
Published: (2025)

Proximal gradient-type method with generalized distance and convergence analysis without global descent lemma
by: Yagishita, Shotaro, et al.
Published: (2025)

Fast algorithm for sparse least trimmed squares via trimmed-regularized reformulation
by: Yagishita, Shotaro
Published: (2024)

Optimal reinsurance and investment via stochastic projected gradient method based on Malliavin calculus
by: Otsuki, Yuta, et al.
Published: (2024)

Exact Penalization at D-Stationary Points of Cardinality- or Rank-Constrained Problem
by: Yagishita, Shotaro, et al.
Published: (2022)

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

Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization
by: Lan, Guanghui, et al.
Published: (2023)

A linesearch-type normal map-based semismooth Newton method for nonsmooth nonconvex composite optimization
by: Zeng, Hanfeng, et al.
Published: (2026)

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

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

Stability of first-order methods in tame optimization
by: Lai, Lexiao
Published: (2024)

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

Differential estimates for fast first-order multilevel nonconvex optimisation
by: Dizon, Neil, et al.
Published: (2024)

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

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

A linesearch-based derivative-free method for noisy black-box problems
by: De Santis, Alberto, et al.
Published: (2025)

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

On iteratively regularized first-order methods for simple bilevel optimization
by: Samadi, Sepideh, et al.
Published: (2025)

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

Bounds for the tracking error of first-order online optimization methods
by: Madden, Liam, et al.
Published: (2020)

Worst case complexity bounds for linesearch-type derivative-free algorithms
by: Brilli, Andrea, et al.
Published: (2023)

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

The inexact power augmented Lagrangian method for constrained nonconvex optimization
by: Bodard, Alexander, 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 optimal first-order method for smooth and strongly convex composite optimization and its stationary limit
by: Upadhyaya, Manu, et al.
Published: (2026)

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

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

Introducing the method of ellipcenters, a new first order technique for unconstrained optimization
by: Behling, Roger, et al.
Published: (2025)

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

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

Stochastic ADMM with batch size adaptation for nonconvex nonsmooth optimization
by: Jin, Jiachen, et al.
Published: (2025)

Global convergence of a modified BFGS-type method based on function information for nonconvex multiobjective optimization problems
by: Yang, Yingxue
Published: (2024)

Eigenvalue programming beyond matrices
by: Ito, Masaru, et al.
Published: (2023)

Computer-aided analyses of stochastic first-order methods, via interpolation conditions for stochastic optimization
by: Rubbens, Anne, et al.
Published: (2025)

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

A deterministic optimization algorithm for nonconvex and combinatorial bi-objective programming
by: Lee, Ye Seol, et al.
Published: (2024)

Distributed nonconvex optimization for control of water networks with time-coupling constraints
by: Jenks, Bradley, et al.
Published: (2023)

An accelerated first-order regularized momentum descent ascent algorithm for stochastic nonconvex-concave minimax problems
by: Zhang, Huiling, et al.
Published: (2023)

Global minimisation of nonconvex functions by generalising the mirror descent method
by: Millán, Reinier Díaz, et al.
Published: (2024)

A second-order cone representable class of nonconvex quadratic programs
by: Dey, Santanu S., et al.
Published: (2025)