Cover Image

Computing Bouligand stationary points efficiently in low-rank optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Olikier, Guillaume, Absil, P. -A.
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control Numerical Analysis 14M12, 65K10, 90C26, 90C30, 40A05
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Low-rank optimization methods based on projected projected-gradient descent that accumulate at Bouligand stationary points
by: Olikier, Guillaume, et al.
Published: (2022)

An apocalypse-free first-order low-rank optimization algorithm with at most one rank reduction attempt per iteration
by: Olikier, Guillaume, et al.
Published: (2022)

Projected gradient descent accumulates at Bouligand stationary points
by: Olikier, Guillaume, et al.
Published: (2024)

Stochastic momentum ADMM for nonconvex and nonsmooth optimization with application to PnP algorithm
by: Deng, Kangkang, et al.
Published: (2025)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
by: Zhou, Juan, et al.
Published: (2024)

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

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

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

Tight Error Bounds for the Sign-Constrained Stiefel Manifold
by: Chen, Xiaojun, et al.
Published: (2022)

Parameter-Free Accelerated Quasi-Newton Method for Nonconvex Optimization
by: Marumo, Naoki
Published: (2025)

Proximal methods for structured nonsmooth optimization over Riemannian submanifolds
by: Li, Qia, et al.
Published: (2024)

Universal heavy-ball method for nonconvex optimization under Hölder continuous Hessians
by: Marumo, Naoki, et al.
Published: (2023)

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

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

AS-BOX: Additional Sampling Method for Weighted Sum Problems with Box Constraints
by: Krejić, Nataša, et al.
Published: (2025)

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

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

Variance-reduced first-order methods for deterministically constrained stochastic nonconvex optimization with strong convergence guarantees
by: Lu, Zhaosong, et al.
Published: (2024)

Steering exact penalty DCA for nonsmooth DC optimization problems with equality and inequality constraints
by: Dolgopolik, M. V.
Published: (2021)

A modified exact penalty approach for general constrained $\ell_0$-sparse optimization problems
by: Kanzow, Christian, et al.
Published: (2025)

Solving bilevel optimization via sequential minimax optimization
by: Lu, Zhaosong, et al.
Published: (2025)

A min-max reformulation and proximal algorithms for a class of structured nonsmooth fractional optimization problems
by: Zhou, Junpeng, et al.
Published: (2025)

ASPEN: An Additional Sampling Penalty Method for Finite-Sum Optimization Problems with Nonlinear Equality Constraints
by: Krejić, Nataša, et al.
Published: (2025)

The Augmented Mixing Method: Computing High-Accuracy Primal-Dual Solutions to Large-Scale SDPs via Column Updates
by: Brosch, Daniel, et al.
Published: (2025)

Global optimality conditions for sensor placement, with extensions to binary low-rank A-optimal designs
by: Aarset, Christian
Published: (2024)

Proximal Gradient Descent Ascent Methods for Nonsmooth Nonconvex-Concave Minimax Problems on Riemannian Manifolds
by: Xie, Xiyuan, et al.
Published: (2025)

Convergence-Guaranteed Algorithms for l1/2-Regularized Quadratic Programs with Assignment Constraints
by: Xie, Lijun, et al.
Published: (2025)

Local Convergence Analysis of ADMM for Nonconvex Composite Optimization
by: Xie, Xiyuan, et al.
Published: (2026)

First-order penalty methods for bilevel optimization
by: Lu, Zhaosong, et al.
Published: (2023)

A first-order augmented Lagrangian method for constrained minimax optimization
by: Lu, Zhaosong, et al.
Published: (2023)

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

A first-order method for nonconvex-strongly-concave constrained minimax optimization
by: Lu, Zhaosong, et al.
Published: (2025)

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

On Difference-of-SOS and Difference-of-Convex-SOS Decompositions for Polynomials
by: Niu, Yi-Shuai, et al.
Published: (2018)

A novel numerical method tailored for unconstrained optimization problems
by: Li, Lin, et al.
Published: (2025)

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

Swarm-based optimization with jumps: a kinetic BGK framework and convergence analysis
by: Borghi, Giacomo, et al.
Published: (2025)

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

Implicit augmented Lagrangian and generalized optimization
by: De Marchi, Alberto
Published: (2023)

Spectral conjugate gradient projection methods for large-scale monotone equations without Lipschitz continuity
by: Hamiss, Kabenge, et al.
Published: (2026)