Cover Image

An apocalypse-free first-order low-rank optimization algorithm with at most one rank reduction attempt per iteration

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Olikier, Guillaume, Absil, P. -A.
Format:	Preprint
Published:	2022
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

Computing Bouligand stationary points efficiently in low-rank optimization
by: Olikier, Guillaume, et al.
Published: (2024)

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

Projected gradient descent accumulates at Bouligand stationary points
by: Olikier, Guillaume, 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)

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

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

A simple iterative algorithm for maxcut
by: Shao, Sihong, et al.
Published: (2018)

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

Continuous iterative algorithms for anti-Cheeger cut
by: Shao, Sihong, et al.
Published: (2021)

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

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

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

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

On solving a rank regularized minimization problem via equivalent factorized column-sparse regularized models
by: Li, Wenjing, et al.
Published: (2023)

A first-order method for nonconvex-nonconcave minimax problems under a local Kurdyka-Lojasiewicz condition
by: Lu, Zhaosong, et al.
Published: (2025)

An efficient asymptotic DC method for sparse and low-rank matrix recovery
by: Ding, Mingcai, et al.
Published: (2024)

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)

A New Linear Programming Approach and a New Backtracking Strategy for Multiple-Gradient Descent in Multi-Objective Optimization
by: Della Santa, Francesco
Published: (2024)

Globally Optimal Solutions to a Class of Fractional Optimization Problems Based on Proximal Gradient Algorithm
by: Lin, Yizun, et al.
Published: (2023)

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

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

A stochastic use of the Kurdyka-Lojasiewicz property: Investigation of optimization algorithms behaviours in a non-convex differentiable framework
by: Fest, Jean-Baptiste, et al.
Published: (2023)

New vector transport operators extending a Riemannian CG algorithm to generalized Stiefel manifold with low-rank applications
by: Wang, Xuejie, et al.
Published: (2023)

A preconditioned difference of convex functions algorithm with extrapolation and line search
by: Zhang, Ran, et al.
Published: (2025)

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

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

A Convergent ADMM Algorithm for Grain Boundary Energy Minimization
by: Wu, Yue, et al.
Published: (2024)

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

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

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

On a globally convergent semismooth* Newton method in nonsmooth nonconvex optimization
by: Gfrerer, H.
Published: (2024)

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

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

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)

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

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

Extrapolated Plug-and-Play Three-Operator Splitting Methods for Nonconvex Optimization with Applications to Image Restoration
by: Wu, Zhongming, et al.
Published: (2024)

Adaptive Preconditioned Gradient Descent with Energy
by: Liu, Hailiang, et al.
Published: (2023)