An active-set proximal-Newton algorithm for _1 regularized optimization problems with box constraints
From MaRDI portal
Publication:2219645
DOI10.1007/S10915-020-01364-0zbMATH Open1458.90590OpenAlexW3098220721MaRDI QIDQ2219645FDOQ2219645
Authors: Chungen Shen, Wenjuan Xue, Lei-Hong Zhang, Baiyun Wang 
Publication date: 20 January 2021
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10915-020-01364-0
Recommendations
- A second-order method for convex \(\ell_1\)-regularized optimization with active-set prediction
- An algorithm for quadratic \(\ell_1\)-regularized optimization with a flexible active-set strategy
- An active set method for general linear problem subject to box constraints
- A family of second-order methods for convex \(\ell _1\)-regularized optimization
- An active-set proximal quasi-Newton algorithm for ℓ1-regularized minimization over a sphere constraint
Cites Work
- NESTA: A fast and accurate first-order method for sparse recovery
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation
- Probing the Pareto frontier for basis pursuit solutions
- Title not available (Why is that?)
- A repository of convex quadratic programming problems
- Model Selection and Estimation in Regression with Grouped Variables
- Title not available (Why is that?)
- Benchmarking optimization software with performance profiles.
- Sparse inverse covariance estimation with the graphical lasso
- Title not available (Why is that?)
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- Exact matrix completion via convex optimization
- Compressed sensing
- Sparse Reconstruction by Separable Approximation
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- Title not available (Why is that?)
- A Nonmonotone Line Search Technique for Newton’s Method
- A second-order method for convex \(\ell_1\)-regularized optimization with active-set prediction
- A family of second-order methods for convex \(\ell _1\)-regularized optimization
- Title not available (Why is that?)
- Two-Metric Projection Methods for Constrained Optimization
- A truncated Newton method with non-monotone line search for unconstrained optimization
- Foundations of machine learning
- Matrix-free interior point method for compressed sensing problems
- An inexact successive quadratic approximation method for L-1 regularized optimization
- Safe Feature Elimination in Sparse Supervised Learning
- A semismooth Newton method with multidimensional filter globalization for \(l_1\)-optimization
- A nonmonotone conjugate gradient algorithm for unconstrained optimization
- Introduction to nonsmooth optimization. Theory, practice and software
- Projected shrinkage algorithm for box-constrained \(\ell _1\)-minimization
- Curvilinear Stabilization Techniques for Truncated Newton Methods in Large Scale Unconstrained Optimization
- A regularized semi-smooth Newton method with projection steps for composite convex programs
- A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
- Accelerating block coordinate descent methods with identification strategies
Cited In (13)
- An active-set projected trust-region algorithm with limited memory BFGS technique for box-constrained nonsmooth equations
- A truncated Newton algorithm for nonconvex sparse recovery
- An active-set algorithmic framework for non-convex optimization problems over the simplex
- An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
- An active-set projected trust region algorithm for box constrained optimization problems
- An active-set proximal quasi-Newton algorithm for ℓ1-regularized minimization over a sphere constraint
- Proximal gradient/semismooth Newton methods for projection onto a polyhedron via the duality-gap-active-set strategy
- ``Active-set complexity of proximal gradient: how long does it take to find the sparsity pattern?
- An inexact quasi-Newton algorithm for large-scale \(\ell_1\) optimization with box constraints
- An active set Newton-CG method for \(\ell_1\) optimization
- An algorithm for quadratic \(\ell_1\)-regularized optimization with a flexible active-set strategy
- A dual active-set proximal Newton algorithm for sparse approximation of correlation matrices
- An active set method for general linear problem subject to box constraints
Uses Software
This page was built for publication: An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2219645)
