An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems
From MaRDI portal
Publication:2288192
Abstract: The sparse group Lasso is a widely used statistical model which encourages the sparsity both on a group and within the group level. In this paper, we develop an efficient augmented Lagrangian method for large-scale non-overlapping sparse group Lasso problems with each subproblem being solved by a superlinearly convergent inexact semismooth Newton method. Theoretically, we prove that, if the penalty parameter is chosen sufficiently large, the augmented Lagrangian method converges globally at an arbitrarily fast linear rate for the primal iterative sequence, the dual infeasibility, and the duality gap of the primal and dual objective functions. Computationally, we derive explicitly the generalized Jacobian of the proximal mapping associated with the sparse group Lasso regularizer and exploit fully the underlying second order sparsity through the semismooth Newton method. The efficiency and robustness of our proposed algorithm are demonstrated by numerical experiments on both the synthetic and real data sets.
Recommendations
- A dual semismooth Newton based augmented Lagrangian method for large-scale linearly constrained sparse group square-root Lasso problems
- A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
- Efficient sparse semismooth Newton methods for the clustered Lasso problem
- Structured sparsity via alternating direction methods
- Split Bregman algorithms for sparse group lasso with application to MRI reconstruction
Cites work
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A family of second-order methods for convex \(\ell _1\)-regularized optimization
- A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
- A Newton-CG augmented Lagrangian method for semidefinite programming
- A nonsmooth version of Newton's method
- An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming
- An extension of Luque's growth condition
- Asymptotic Convergence Analysis of the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Efficient block-coordinate descent algorithms for the group Lasso
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Gap safe screening rules for sparsity enforcing penalties
- Hankel matrix rank minimization with applications to system identification and realization
- scientific article; zbMATH DE number 4082855 (Why is no real title available?)
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 125253 (Why is no real title available?)
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
- Model Selection and Estimation in Regression with Grouped Variables
- Monotone Operators and the Proximal Point Algorithm
- On efficiently solving the subproblems of a level-set method for fused lasso problems
- On the linear convergence of a proximal gradient method for a class of nonsmooth convex minimization problems
- On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming
- Pathwise coordinate optimization
- Proximal methods for hierarchical sparse coding
- Regularized multivariate regression for identifying master predictors with application to integrative genomics study of breast cancer
- Robust Recovery of Signals From a Structured Union of Subspaces
- Second-order orthant-based methods with enriched Hessian information for sparse \(\ell _1\)-optimization
- Semismooth and Semiconvex Functions in Constrained Optimization
- Semismooth Matrix-Valued Functions
- Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization
- Sparsity and Smoothness Via the Fused Lasso
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
Cited in
(57)- A dual based semismooth Newton-type algorithm for solving large-scale sparse Tikhonov regularization problems
- An efficient Hessian based algorithm for singly linearly and box constrained least squares regression
- A semismooth Newton-based augmented Lagrangian algorithm for density matrix least squares problems
- An investigation on semismooth Newton based augmented Lagrangian method for image restoration
- The linearized alternating direction method of multipliers for sparse group LAD model
- An efficient augmented Lagrangian method with semismooth Newton solver for total generalized variation
- A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
- scientific article; zbMATH DE number 7370526 (Why is no real title available?)
- An efficient linearly convergent regularized proximal point algorithm for fused multiple graphical Lasso problems
- Efficient sparse Hessian-based semismooth Newton algorithms for Dantzig selector
- Sparse Group Lasso: Optimal Sample Complexity, Convergence Rate, and Statistical Inference
- A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer
- Difference-of-Convex Algorithms for a Class of Sparse Group \ell₀ Regularized Optimization Problems
- A proximal point dual Newton algorithm for solving group graphical Lasso problems
- An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming
- The linear and asymptotically superlinear convergence rates of the augmented Lagrangian method with a practical relative error criterion
- Iteratively reweighted group Lasso based on log-composite regularization
- Solving the OSCAR and SLOPE models using a semismooth Newton-based augmented Lagrangian method
- Two-layer feature reduction for sparse-group Lasso via decomposition of convex sets
- Efficient sparse semismooth Newton methods for the clustered Lasso problem
- scientific article; zbMATH DE number 7668288 (Why is no real title available?)
- A dual-based stochastic inexact algorithm for a class of stochastic nonsmooth convex composite problems
- Group linear algorithm with sparse principal decomposition: a variable selection and clustering method for generalized linear models
- Linearly-convergent FISTA variant for composite optimization with duality
- A dual semismooth Newton based augmented Lagrangian method for large-scale linearly constrained sparse group square-root Lasso problems
- Newton-type methods with the proximal gradient step for sparse estimation
- A semismooth Newton stochastic proximal point algorithm with variance reduction
- A Corrected Inexact Proximal Augmented Lagrangian Method with a Relative Error Criterion for a Class of Group-Quadratic Regularized Optimal Transport Problems
- An efficient sieving-based secant method for sparse optimization problems with least-squares constraints
- Continuous exact relaxation and alternating proximal gradient algorithm for partial sparse and partial group sparse optimization problems
- Group sparse structural smoothing recovery: model, statistical properties and algorithm
- A generalized formulation for group selection via ADMM
- Smoothing composite proximal gradient algorithm for sparse group Lasso problems with nonsmooth loss functions
- A highly efficient algorithm for solving exclusive lasso problems
- A proximal sub-gradient method for group Lasso-type problems
- A C-FISTA-type Krasnosel'skiĭ-Mann iteration with applications to TV-based denoising problem and image in-painting
- Wasserstein distributionally robust optimization and its tractable regularization formulation
- Multi-Task Learning for Gaussian Graphical Regressions with High Dimensional Covariates
- Adaptive sieving: a dimension reduction technique for sparse optimization problems
- A dual adaptive algorithm for matrix optimization with sparse group Lasso regularization
- Learning the hub graphical Lasso model with the structured sparsity via an efficient algorithm
- An inexact Bregman proximal difference-of-convex algorithm with two types of relative stopping criteria
- Sparse-Group Boosting: Unbiased Group and Variable Selection
- A unified consensus-based parallel algorithm for high-dimensional regression with combined regularizations
- C-FISTA type projection algorithm for quasi-variational inequalities
- Multiple regression for matrix and vector predictors: models, theory, algorithms, and beyond
- Optimality conditions for group sparsity constrained optimization problems with equality and inequality constraints
- Sharp optimality of sparse group LASSO and SLOPE under weaker assumptions
- An efficient algorithm for the weighted elastic net penalized quantile regression
- Low rank convex clustering for matrix-valued observations
- Self-concordant smoothing in proximal quasi-Newton algorithms for large-scale convex composite optimization
- Fast computation of superquantile-constrained optimization through implicit scenario reduction
- The augmented Lagrangian methods: overview and recent advances
- A semismooth Newton based augmented Lagrangian algorithm for Lovász theta SDP problem
- Composite optimization with indicator functions: stationary duality and a semismooth Newton method
- sglssnal
- Group zero-norm regularized robust loss minimization: proximal MM method and statistical error bound
This page was built for publication: An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2288192)
