Exact Penalty Function for $\ell_{2,1}$ Norm Minimization over the Stiefel Manifold
From MaRDI portal
Publication:5020849
DOI10.1137/20M1354313zbMath1484.65130OpenAlexW3214820890MaRDI QIDQ5020849
Xin Liu, Nachuan Xiao, Ya-Xiang Yuan
Publication date: 7 January 2022
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/20m1354313
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A feasible method for optimization with orthogonality constraints
- A splitting method for orthogonality constrained problems
- Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing
- Coordinate-independent sparse sufficient dimension reduction and variable selection
- A framework of constraint preserving update schemes for optimization on Stiefel manifold
- Conjugate gradient algorithm for optimization under unitary matrix constraint
- Superlinear convergence of a Newton-type algorithm for monotone equations
- Augmented-Lagrangian regularization of matrix-valued maps
- A Riemannian subgradient algorithm for economic dispatch with valve-point effect
- A nonsmooth version of Newton's method
- Trust-region methods on Riemannian manifolds
- Sparse PCA: optimal rates and adaptive estimation
- Optimization theory and methods. Nonlinear programming
- A Second Order Nonsmooth Variational Model for Restoring Manifold-Valued Images
- Manopt, a Matlab toolbox for optimization on manifolds
- A Riemannian Gradient Sampling Algorithm for Nonsmooth Optimization on Manifolds
- A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
- Adaptive Quadratically Regularized Newton Method for Riemannian Optimization
- An Augmented Lagrangian Method for $\ell_{1}$-Regularized Optimization Problems with Orthogonality Constraints
- The Geometry of Algorithms with Orthogonality Constraints
- Variational Analysis
- Steepest Descent Algorithms for Optimization Under Unitary Matrix Constraint
- Sparse Variable PCA Using Geodesic Steepest Descent
- A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints
- Nonsmooth trust region algorithms for locally Lipschitz functions on Riemannian manifolds
- Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold
- Parallelizable Algorithms for Optimization Problems with Orthogonality Constraints
- Optimization algorithms exploiting unitary constraints
- Nonsmooth Riemannian Optimization with Applications to Sphere Packing and Grasping
This page was built for publication: Exact Penalty Function for $\ell_{2,1}$ Norm Minimization over the Stiefel Manifold
