An active-set proximal quasi-Newton algorithm for ℓ1-regularized minimization over a sphere constraint
From MaRDI portal
Publication:5870141
Recommendations
- Stochastic proximal gradient method FOR _1 regularized optimization over a sphere
- Minimization over the _1-ball using an active-set non-monotone projected gradient
- An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints
- A preconditioned conjugate gradient method with active set strategy for \(\ell_1\)-regularized least squares
- An algorithm for quadratic _1-regularized optimization with a flexible active-set strategy
Cites work
- -subgradient algorithms for locally Lipschitz functions on Riemannian manifolds
- A brief introduction to manifold optimization
- A collection of nonsmooth Riemannian optimization problems
- A Direct Formulation for Sparse PCA Using Semidefinite Programming
- A family of second-order methods for convex \(\ell _1\)-regularized optimization
- A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
- A new approach to the proximal point method: convergence on general Riemannian manifolds
- A Nonmonotone Line Search Technique for Newton’s Method
- A nonsmooth version of Newton's method
- A regularized semi-smooth Newton method with projection steps for composite convex programs
- A repository of convex quadratic programming problems
- A Riemannian gradient sampling algorithm for nonsmooth optimization on manifolds
- A Riemannian subgradient algorithm for economic dispatch with valve-point effect
- A second-order method for convex _1-regularized optimization with active-set prediction
- A semismooth Newton method with multidimensional filter globalization for l₁-optimization
- A splitting method for orthogonality constrained problems
- Active Set Identification in Nonlinear Programming
- An inexact successive quadratic approximation method for L-1 regularized optimization
- Benchmarking optimization software with performance profiles.
- 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
- Conditional gradient algorithms for rank-one matrix approximations with a sparsity constraint
- Finding a Sparse Vector in a Subspace: Linear Sparsity Using Alternating Directions
- Fixed-Point Continuation for \ell₁-Minimization: Methodology and Convergence
- Generalized power method for sparse principal component analysis
- Global rates of convergence for nonconvex optimization on manifolds
- scientific article; zbMATH DE number 5223994 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds
- Matrix-free interior point method for compressed sensing problems
- NESTA: A fast and accurate first-order method for sparse recovery
- Nonsmoothness in machine learning: specific structure, proximal identification, and applications
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- On optimizing the sum of the Rayleigh quotient and the generalized Rayleigh quotient on the unit sphere
- On uniqueness of Kuhn-Tucker multipliers in nonlinear programming
- Optimal solutions for sparse principal component analysis
- Optimality conditions for the nonlinear programming problems on Riemannian manifolds
- Probing the Pareto frontier for basis pursuit solutions
- Projection algorithms for nonconvex minimization with application to sparse principal component analysis
- Proximal gradient method for nonsmooth optimization over the Stiefel manifold
- Proximal Point Algorithm On Riemannian Manifolds
- Sampling Sparse Signals on the Sphere: Algorithms and Applications
- Sparse Reconstruction by Separable Approximation
- Subgradient algorithm on Riemannian manifolds
- The Geometry of Algorithms with Orthogonality Constraints
- Truncated power method for sparse eigenvalue problems
Cited in
(4)- Minimization over the _1-ball using an active-set non-monotone projected gradient
- An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints
- Stochastic proximal gradient method FOR _1 regularized optimization over a sphere
- A dual adaptive algorithm for matrix optimization with sparse group Lasso regularization
This page was built for publication: An active-set proximal quasi-Newton algorithm for ℓ1-regularized minimization over a sphere constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5870141)
