An Augmented Lagrangian Method for $\ell_{1}$-Regularized Optimization Problems with Orthogonality Constraints
From MaRDI portal
Publication:3186107
DOI10.1137/140988875zbMath1386.65160OpenAlexW2480121964MaRDI QIDQ3186107
Yanfei You, Weiqiang Chen, Hui Ji
Publication date: 8 August 2016
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/140988875
Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Numerical solution of eigenvalue problems involving ordinary differential equations (65L15) Variational methods for eigenvalues of operators (49R05)
Related Items
Riemannian proximal gradient methods ⋮ DC semidefinite programming and cone constrained DC optimization. I: Theory ⋮ Nonconvex and nonsmooth optimization with generalized orthogonality constraints: an approximate augmented Lagrangian method ⋮ A semismooth Newton based augmented Lagrangian method for nonsmooth optimization on matrix manifolds ⋮ A penalty-free infeasible approach for a class of nonsmooth optimization problems over the Stiefel manifold ⋮ A communication-efficient and privacy-aware distributed algorithm for sparse PCA ⋮ AN EFFICIENT METHOD FOR SOLVING A CLASS OF MATRIX TRACE FUNCTION MINIMIZATION PROBLEM IN MULTIVARIATE STATISTICAL ⋮ Efficient alternating minimization methods for variational edge-weighted colorization models ⋮ Nonisometric surface registration via conformal Laplace-Beltrami basis pursuit ⋮ Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold ⋮ An Inexact Semismooth Newton Method on Riemannian Manifolds with Application to Duality-Based Total Variation Denoising ⋮ Exact Penalty Function for $\ell_{2,1}$ Norm Minimization over the Stiefel Manifold
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A feasible method for optimization with orthogonality constraints
- Nonlinear total variation based noise removal algorithms
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- A splitting method for orthogonality constrained problems
- An augmented Lagrangian approach for sparse principal component analysis
- Density matrix minimization with \({\ell}_1\) regularization
- Fast linearized Bregman iteration for compressive sensing and sparse denoising
- Lasso-type recovery of sparse representations for high-dimensional data
- Asymptotics for the minimization of a Ginzburg-Landau functional
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Trace-penalty minimization for large-scale eigenspace computation
- Exact matrix completion via convex optimization
- Compressed plane waves yield a compactly supported multiresolution basis for the Laplace operator
- Robust principal component analysis?
- Convergence of the linearized Bregman iteration for ℓ₁-norm minimization
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- A Curvilinear Search Method for p-Harmonic Flows on Spheres
- The Split Bregman Method for L1-Regularized Problems
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- The Geometry of Algorithms with Orthogonality Constraints
- Variational Analysis
- High-Order Total Variation-Based Image Restoration
- Compressed modes for variational problems in mathematics and physics
- On the Consistency of Compressed Modes for Variational Problems Associated with the Schrödinger Operator
- Optimization algorithms exploiting unitary constraints
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing
This page was built for publication: An Augmented Lagrangian Method for $\ell_{1}$-Regularized Optimization Problems with Orthogonality Constraints
