Nonsmooth optimization over the Stiefel manifold and beyond: proximal gradient method and recent variants
From MaRDI portal
Publication:6540011
DOI10.1137/24m1628578zbMath1546.90229MaRDI QIDQ6540011
Anthony Man-Cho So, Shixiang Chen, Tong Zhang, Shi-Qian Ma
Publication date: 15 May 2024
Published in: SIAM Review (Search for Journal in Brave)
Stiefel manifoldstochastic algorithmsnonsmoothiteration complexitysemismooth Newton methodproximal gradient methodmanifold optimizationzeroth-order algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A feasible method for optimization with orthogonality constraints
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Nearly unbiased variable selection under minimax concave penalty
- \(\varepsilon\)-subgradient algorithms for locally Lipschitz functions on Riemannian manifolds
- A new approach to the proximal point method: convergence on general Riemannian manifolds
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Alternating direction method of multipliers for sparse principal component analysis
- A splitting method for orthogonality constrained problems
- Low-rank retractions: a survey and new results
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- Generalized gradients and characterization of epi-Lipschitz sets in Riemannian manifolds
- Analysis of a complex of statistical variables into principal components.
- A framework of constraint preserving update schemes for optimization on Stiefel manifold
- Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
- Sparse principal component analysis via regularized low rank matrix approximation
- Conjugate gradient algorithm for optimization under unitary matrix constraint
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Subgradient algorithm on Riemannian manifolds
- On lines and planes of closest fit to systems of points in space.
- A regularized semi-smooth Newton method with projection steps for composite convex programs
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Superlinear convergence of a Newton-type algorithm for monotone equations
- A geometric analysis of phase retrieval
- Riemannian proximal gradient methods
- Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis
- A Riemannian subgradient algorithm for economic dispatch with valve-point effect
- A collection of nonsmooth Riemannian optimization problems
- Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods
- Robust computation of linear models by convex relaxation
- Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds
- A nonsmooth version of Newton's method
- Random gradient-free minimization of convex functions
- Nonconvex and nonsmooth optimization with generalized orthogonality constraints: an approximate augmented Lagrangian method
- A Second Order Nonsmooth Variational Model for Restoring Manifold-Valued Images
- Weakly Correlated Sparse Components with Nearly Orthonormal Loadings
- Nonconvex Phase Synchronization
- A Proximal Point Algorithm for Log-Determinant Optimization with Group Lasso Regularization
- Low-Rank Matrix Completion by Riemannian Optimization
- Generalized power method for sparse principal component analysis
- Manopt, a Matlab toolbox for optimization on manifolds
- A Riemannian Gradient Sampling Algorithm for Nonsmooth Optimization on Manifolds
- Complete Dictionary Recovery Over the Sphere I: Overview and the Geometric Picture
- An augmented Lagrangian dual approach for the H-weighted nearest correlation matrix problem
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- Solving Log-Determinant Optimization Problems by a Newton-CG Primal Proximal Point Algorithm
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- The Split Bregman Method for L1-Regularized Problems
- A Fast Algorithm for Edge-Preserving Variational Multichannel Image Restoration
- An Augmented Lagrangian Method for $\ell_{1}$-Regularized Optimization Problems with Orthogonality Constraints
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Semismooth and Semiconvex Functions in Constrained Optimization
- The Geometry of Algorithms with Orthogonality Constraints
- Proximal Point Algorithm On Riemannian Manifolds
- Non-Convex Phase Retrieval From STFT Measurements
- Steepest Descent Algorithms for Optimization Under Unitary Matrix Constraint
- On the Estimation Performance and Convergence Rate of the Generalized Power Method for Phase Synchronization
- A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems
- Line Search Algorithms for Locally Lipschitz Functions on Riemannian Manifolds
- A Well-Tempered Landscape for Non-convex Robust Subspace Recovery
- Nonsmooth trust region algorithms for locally Lipschitz functions on Riemannian manifolds
- Weakly Convex Optimization over Stiefel Manifold Using Riemannian Subgradient-Type Methods
- An Introduction to Optimization on Smooth Manifolds
- Robust Low-Rank Matrix Completion via an Alternating Manifold Proximal Gradient Continuation Method
- Global rates of convergence for nonconvex optimization on manifolds
- Compressed modes for variational problems in mathematics and physics
- Quasi-Newton Methods on Grassmannians and Multilinear Approximations of Tensors
- Blind Deconvolution by a Steepest Descent Algorithm on a Quotient Manifold
- Fast, robust and non-convex subspace recovery
- Fast Image Recovery Using Variable Splitting and Constrained Optimization
- Manifolds of Negative Curvature
- A Direct Formulation for Sparse PCA Using Semidefinite Programming
- Manifold Proximal Point Algorithms for Dual Principal Component Pursuit and Orthogonal Dictionary Learning
- A unified approach to synchronization problems over subgroups of the orthogonal group
- Stochastic Zeroth-Order Riemannian Derivative Estimation and Optimization
- Linear Convergence of a Proximal Alternating Minimization Method with Extrapolation for \(\boldsymbol{\ell_1}\) -Norm Principal Component Analysis
- A Riemannian Proximal Newton Method
- A Riemannian smoothing steepest descent method for non-Lipschitz optimization on embedded submanifolds of \(\mathbb{R}^n\)
This page was built for publication: Nonsmooth optimization over the Stiefel manifold and beyond: proximal gradient method and recent variants