Image de couverture de livre

Projected gradient descent accumulates at Bouligand stationary points

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Olikier, Guillaume, Waldspurger, Irène
Format:	Preprint
Publié:	2024
Sujets:	Optimization and Control Numerical Analysis 65K10, 49J53, 90C26, 90C30, 90C46
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Low-rank optimization methods based on projected projected-gradient descent that accumulate at Bouligand stationary points
par: Olikier, Guillaume, et autres
Publié: (2022)

Computing Bouligand stationary points efficiently in low-rank optimization
par: Olikier, Guillaume, et autres
Publié: (2024)

Nonmonotone subgradient methods based on a local descent lemma
par: Aragón-Artacho, Francisco J., et autres
Publié: (2025)

ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization
par: Kabgani, Alireza, et autres
Publié: (2025)

Shadow splitting methods for nonconvex optimisation: epi-approximation, convergence and saddle point avoidance
par: Atenas, Felipe
Publié: (2025)

Parameter-Free Accelerated Quasi-Newton Method for Nonconvex Optimization
par: Marumo, Naoki
Publié: (2025)

Local properties and augmented Lagrangians in fully nonconvex composite optimization
par: De Marchi, Alberto, et autres
Publié: (2023)

A structured L-BFGS method and its application to inverse problems
par: Mannel, Florian, et autres
Publié: (2023)

A structured L-BFGS method with diagonal scaling and its application to image registration
par: Mannel, Florian, et autres
Publié: (2024)

Variational analysis of determinantal varieties
par: Yang, Yan, et autres
Publié: (2025)

Understanding the Douglas-Rachford splitting method through the lenses of Moreau-type envelopes
par: Atenas, Felipe
Publié: (2023)

Sublinear Scalarizations for Proper and Approximate Proper Efficient Points in Nonconvex Vector Optimization
par: García-Castaño, Fernando, et autres
Publié: (2024)

The adjoint state method for parametric definable optimization without smoothness or uniqueness
par: Bolte, Jérôme, et autres
Publié: (2026)

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

On second-order optimality conditions for $C^{1,1}$ optimization problems via Lagrangian functions
par: An, Duong Thi Viet, et autres
Publié: (2024)

On second-order Karush--Kuhn--Tucker optimality conditions for $C^{1,1}$ vector optimization problems
par: Van Tuyen, Nguyen
Publié: (2025)

An interior-point trust-region method for nonsmooth regularized bound-constrained optimization
par: Leconte, Geoffroy, et autres
Publié: (2024)

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

The effect of smooth parametrizations on nonconvex optimization landscapes
par: Levin, Eitan, et autres
Publié: (2022)

Approximate stationarity in disjunctive optimization: concepts, qualification conditions, and application to MPCCs
par: Käming, Isabella, et autres
Publié: (2025)

ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope
par: Kabgani, Alireza, et autres
Publié: (2024)

Splitting the Conditional Gradient Algorithm
par: Woodstock, Zev, et autres
Publié: (2023)

An apocalypse-free first-order low-rank optimization algorithm with at most one rank reduction attempt per iteration
par: Olikier, Guillaume, et autres
Publié: (2022)

Moreau envelope and proximal-point methods under the lens of high-order regularization
par: Kabgani, Alireza, et autres
Publié: (2025)

Optimization Problems with Nearly Convex Objective Functions and Nearly Convex Constraint Sets
par: Thieu, Nguyen Nang, et autres
Publié: (2026)

A new problem qualification based on approximate KKT conditions for Lipschitzian optimization with application to bilevel programming
par: Käming, Isabella, et autres
Publié: (2024)

A modified exact penalty approach for general constrained $\ell_0$-sparse optimization problems
par: Kanzow, Christian, et autres
Publié: (2025)

Nonsmooth convex-concave saddle point problems with cardinality penalties
par: Bian, Wei, et autres
Publié: (2024)

Directional Subdifferentials at Infinity and Its Applications
par: Kien, Le Ngoc, et autres
Publié: (2025)

Approximate directional stationarity and associated qualification conditions
par: Käming, Isabella, et autres
Publié: (2026)

A relaxed version of Ryu's three-operator splitting method for structured nonconvex optimization
par: Alcantara, Jan Harold, et autres
Publié: (2025)

Finding directional stationary points of DC programs
par: Thi, Hoai An Le, et autres
Publié: (2026)

Riemannian Trust Region Methods for SC$^1$ Minimization
par: Zhang, Chenyu, et autres
Publié: (2023)

Stochastic momentum ADMM for nonconvex and nonsmooth optimization with application to PnP algorithm
par: Deng, Kangkang, et autres
Publié: (2025)

An Inexact Regularized Proximal Newton Method without Line Search
par: Dahl, Simeon vom, et autres
Publié: (2024)

An Inexact Boosted Difference of Convex Algorithm for Nondifferentiable Functions
par: Ferreira, Orizon P., et autres
Publié: (2024)

A penalty barrier framework for nonconvex constrained optimization
par: De Marchi, Alberto, et autres
Publié: (2024)

Proximal Limited-Memory Quasi-Newton Methods for Nonsmooth Nonconvex Optimization
par: Dahl, Simeon vom, et autres
Publié: (2026)

PANOC-lite: A simpler and more efficient algorithm for composite minimization
par: Bodard, Alexander, et autres
Publié: (2026)

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