An active-set proximal quasi-Newton algorithm for ℓ1-regularized minimization over a sphere constraint
From MaRDI portal
Publication:5870141
DOI10.1080/02331934.2021.1958809OpenAlexW3192226722MaRDI QIDQ5870141
Chungen Shen, Lei-Hong Zhang, Ling Mi
Publication date: 5 January 2023
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2021.1958809
quasi-Newton methodproximal gradient methodspherical constraintactive-set method\(\ell_1\)-regularized optimization
Uses Software
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- \(\varepsilon\)-subgradient algorithms for locally Lipschitz functions on Riemannian manifolds
- A new approach to the proximal point method: convergence on general Riemannian manifolds
- An inexact successive quadratic approximation method for L-1 regularized optimization
- Projection algorithms for nonconvex minimization with application to sparse principal component analysis
- A family of second-order methods for convex \(\ell _1\)-regularized optimization
- A splitting method for orthogonality constrained problems
- Matrix-free interior point method for compressed sensing problems
- Nonsmoothness in machine learning: specific structure, proximal identification, and applications
- Subgradient algorithm on Riemannian manifolds
- A regularized semi-smooth Newton method with projection steps for composite convex programs
- On optimizing the sum of the Rayleigh quotient and the generalized Rayleigh quotient on the unit sphere
- A brief introduction to manifold optimization
- A Riemannian subgradient algorithm for economic dispatch with valve-point effect
- A collection of nonsmooth Riemannian optimization problems
- Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds
- A nonsmooth version of Newton's method
- A second-order method for convex1-regularized optimization with active-set prediction
- Generalized power method for sparse principal component analysis
- A Riemannian Gradient Sampling Algorithm for Nonsmooth Optimization on Manifolds
- Finding a Sparse Vector in a Subspace: Linear Sparsity Using Alternating Directions
- Complete Dictionary Recovery Over the Sphere I: Overview and the Geometric Picture
- Complete Dictionary Recovery Over the Sphere II: Recovery by Riemannian Trust-Region Method
- A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
- NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- Active Set Identification in Nonlinear Programming
- Probing the Pareto Frontier for Basis Pursuit Solutions
- On uniqueness of Kuhn-Tucker multipliers in nonlinear programming
- The Geometry of Algorithms with Orthogonality Constraints
- A repository of convex quadratic programming problems
- Proximal Point Algorithm On Riemannian Manifolds
- Sparse Reconstruction by Separable Approximation
- A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems
- Sampling Sparse Signals on the Sphere: Algorithms and Applications
- A Nonmonotone Line Search Technique for Newton’s Method
- Conditional Gradient Algorithmsfor Rank-One Matrix Approximations with a Sparsity Constraint
- A Semismooth Newton Method with Multidimensional Filter Globalization for $l_1$-Optimization
- Global rates of convergence for nonconvex optimization on manifolds
- Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold
- A Direct Formulation for Sparse PCA Using Semidefinite Programming
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Benchmarking optimization software with performance profiles.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An active-set proximal quasi-Newton algorithm for ℓ1-regularized minimization over a sphere constraint
