An inexact successive quadratic approximation method for L-1 regularized optimization
From MaRDI portal
Abstract: We study a Newton-like method for the minimization of an objective function that is the sum of a smooth convex function and an l-1 regularization term. This method, which is sometimes referred to in the literature as a proximal Newton method, computes a step by minimizing a piecewise quadratic model of the objective function. In order to make this approach efficient in practice, it is imperative to perform this inner minimization inexactly. In this paper, we give inexactness conditions that guarantee global convergence and that can be used to control the local rate of convergence of the iteration. Our inexactness conditions are based on a semi-smooth function that represents a (continuous) measure of the optimality conditions of the problem, and that embodies the soft-thresholding iteration. We give careful consideration to the algorithm employed for the inner minimization, and report numerical results on two test sets originating in machine learning.
Recommendations
- Inexact successive quadratic approximation for regularized optimization
- Semismooth Newton and quasi-Newton methods in weighted ^1-regularization
- An algorithm for quadratic _1-regularized optimization with a flexible active-set strategy
- A reduced-space algorithm for minimizing _1-regularized convex functions
- A family of second-order methods for convex \(\ell _1\)-regularized optimization
Cites work
- A comparison of optimization methods and software for large-scale L1-regularized linear classifi\-cation
- A family of second-order methods for convex \(\ell _1\)-regularized optimization
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A semismooth Newton method with multidimensional filter globalization for l₁-optimization
- An improved GLMNET for L1-regularized logistic regression
- An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection
- Convergence of inexact Newton methods for generalized equations
- Cost Approximation: A Unified Framework of Descent Algorithms for Nonlinear Programs
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- Inexact and accelerated proximal point algorithms
- Inexact coordinate descent: complexity and preconditioning
- Inexact Newton Methods
- Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data
- Nonlinear programming and variational inequality problems. A unified approach
- Numerical Optimization
- Representations of quasi-Newton matrices and their use in limited memory methods
- Sample size selection in optimization methods for machine learning
- Templates for convex cone problems with applications to sparse signal recovery
Cited in
(54)- A flexible coordinate descent method
- Global convergence rate analysis of unconstrained optimization methods based on probabilistic models
- Sub-sampled Newton methods
- A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property
- Proximal quasi-Newton methods for regularized convex optimization with linear and accelerated sublinear convergence rates
- Descentwise inexact proximal algorithms for smooth optimization
- Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems
- Globalized inexact proximal Newton-type methods for nonconvex composite functions
- An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems
- Second order semi-smooth proximal Newton methods in Hilbert spaces
- Global complexity analysis of inexact successive quadratic approximation methods for regularized optimization under mild assumptions
- An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints
- Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria
- Performance of first- and second-order methods for _1-regularized least squares problems
- Inexact successive quadratic approximation for regularized optimization
- An active set Newton-CG method for \(\ell_1\) optimization
- A globally convergent proximal Newton-type method in nonsmooth convex optimization
- Semismooth Newton and quasi-Newton methods in weighted ^1-regularization
- An inexact coordinate descent method for the weighted \(l_{1}\)-regularized convex optimization problem
- A family of second-order methods for convex \(\ell _1\)-regularized optimization
- Adaptive quadratically regularized Newton method for Riemannian optimization
- Practical inexact proximal quasi-Newton method with global complexity analysis
- A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
- FarRSA for \(\ell_1\)-regularized convex optimization: local convergence and numerical experience
- Optimization methods for large-scale machine learning
- Stochastic proximal gradient method FOR _1 regularized optimization over a sphere
- An iterative reduction FISTA algorithm for large-scale LASSO
- Efficient evaluation of scaled proximal operators
- A unified adaptive tensor approximation scheme to accelerate composite convex optimization
- Inexact proximal stochastic second-order methods for nonconvex composite optimization
- Stochastic proximal quasi-Newton methods for non-convex composite optimization
- An efficient proximal block coordinate homotopy method for large-scale sparse least squares problems
- Inexact proximal Newton methods for self-concordant functions
- An inexact variable metric proximal point algorithm for generic quasi-Newton acceleration
- Fused multiple graphical lasso
- A reduced-space algorithm for minimizing _1-regularized convex functions
- IMRO: A proximal quasi-Newton method for solving _1-regularized least squares problems
- An inexact semismooth Newton method on Riemannian manifolds with application to duality-based total variation denoising
- An active-set proximal quasi-Newton algorithm for ℓ1-regularized minimization over a sphere constraint
- An inexact quasi-Newton algorithm for large-scale \(\ell_1\) optimization with box constraints
- Concave Likelihood-Based Regression with Finite-Support Response Variables
- Inexact proximal DC Newton-type method for nonconvex composite functions
- Accelerating inexact successive quadratic approximation for regularized optimization through manifold identification
- Inexact proximal Newton methods in Hilbert spaces
- Local convergence analysis of an inexact trust-region method for nonsmooth optimization
- A VMiPG method for composite optimization with nonsmooth term having no closed-form proximal mapping
- An inexact regularized proximal Newton method without line search
- A proximal stochastic quasi-Newton algorithm with dynamical sampling and stochastic line search
- Efficient proximal subproblem solvers for a nonsmooth trust-region method
- Robust decentralized control of interval DC linked hybrid microgrids network
- Enhancing convergence speed in sparse signal denoising: the APFISTA algorithm
- An inexact variable metric variant of incremental aggregated Forward-Backward method for the large-scale composite optimization problem
- An inexact proximal Newton method for nonconvex composite minimization
- A linesearch-type normal map-based semismooth Newton method for nonsmooth nonconvex composite optimization
This page was built for publication: An inexact successive quadratic approximation method for L-1 regularized optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q301652)
