A penalty-free infeasible approach for a class of nonsmooth optimization problems over the Stiefel manifold

DOI10.1007/s10915-024-02495-4arXiv2103.03514OpenAlexW3133689119MaRDI QIDQ6120009

Ya-Xiang Yuan, Xin Liu, Nachuan Xiao

Publication date: 25 March 2024

Published in: Journal of Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2103.03514

zbMATH Keywords

Stiefel manifoldRiemannian optimizationproximal gradient methodpenalty-free

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Numerical optimization and variational techniques (65K10) Methods of reduced gradient type (90C52)

Cites Work

• Unnamed Item
• A feasible method for optimization with orthogonality constraints
• Sparse principal component analysis and iterative thresholding
• A splitting method for orthogonality constrained problems
• Coordinate-independent sparse sufficient dimension reduction and variable selection
• A nonmonotone filter method for nonlinear optimization
• A framework of constraint preserving update schemes for optimization on Stiefel manifold
• Nonlinear programming without a penalty function or a filter
• Conjugate gradient algorithm for optimization under unitary matrix constraint
• A parallel algorithm for computing the polar decomposition
• Non-monotone trust region methods for nonlinear equality constrained optimization without a penalty function
• Sparse CCA: adaptive estimation and computational barriers
• On the superlinear local convergence of a filter-SQP method
• Estimation of the Lipschitz constant of a function
• A first-order primal-dual algorithm for convex problems with applications to imaging
• Augmented-Lagrangian regularization of matrix-valued maps
• Riemannian proximal gradient methods
• A brief introduction to manifold optimization
• A nonsmooth version of Newton's method
• Trust-region methods on Riemannian manifolds
• Sparse PCA: optimal rates and adaptive estimation
• Manopt, a Matlab toolbox for optimization on manifolds
• KSSOLV—a MATLAB toolbox for solving the Kohn-Sham equations
• A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
• A Sequential Quadratic Programming Method Without A Penalty Function or a Filter for Nonlinear Equality Constrained Optimization
• Adaptive Quadratically Regularized Newton Method for Riemannian Optimization
• An Augmented Lagrangian Method for $\ell_{1}$-Regularized Optimization Problems with Orthogonality Constraints
• Two-Point Step Size Gradient Methods
• The Geometry of Algorithms with Orthogonality Constraints
• 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
• A class of smooth exact penalty function methods for optimization problems with orthogonality constraints
• On the Convergence of Primal-Dual Hybrid Gradient Algorithm
• Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold
• Parallelizable Algorithms for Optimization Problems with Orthogonality Constraints
• Optimization algorithms exploiting unitary constraints
• Semismooth Matrix-Valued Functions
• An Orthogonalization-Free Parallelizable Framework for All-Electron Calculations in Density Functional Theory
• Manifold Proximal Point Algorithms for Dual Principal Component Pursuit and Orthogonal Dictionary Learning
• Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.
• A semismooth Newton based augmented Lagrangian method for nonsmooth optimization on matrix manifolds

This page was built for publication: A penalty-free infeasible approach for a class of nonsmooth optimization problems over the Stiefel manifold