A decomposition method for Lasso problems with zero-sum constraint

Cites Work

A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
Title not available (Why is that?)
Convergence of a block coordinate descent method for nondifferentiable minimization
Regression analysis for microbiome compositional data
Title not available (Why is that?)
The solution path of the generalized lasso
Variable selection in regression with compositional covariates
On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
On the convergence of an active-set method for ℓ₁minimization
Downlink beamforming for DS-CDMA mobile radio with multimedia services
A second-order method for convex₁-regularized optimization with active-set prediction
A family of second-order methods for convex \(\ell _1\)-regularized optimization
Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
A New Active Set Algorithm for Box Constrained Optimization
The 2-coordinate descent method for solving double-sided simplex constrained minimization problems
An active-set algorithmic framework for non-convex optimization problems over the simplex
A comparison of optimization methods and software for large-scale L1-regularized linear classifi\-cation
Safe Feature Elimination in Sparse Supervised Learning
Large-scale active-set box-constrained optimization method with spectral projected gradients
An algorithm for quadratic ℓ₁-regularized optimization with a flexible active-set strategy
An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization
Title not available (Why is that?)
Family of projected descent methods for optimization problems with simple bounds
On the convergence of the coordinate descent method for convex differentiable minimization
An almost cyclic 2-coordinate descent method for singly linearly constrained problems
On the convergence of a modified version of SVM^lightalgorithm
An augmented Lagrangian method exploiting an active-set strategy and second-order information
Algorithms for Fitting the Constrained Lasso
A two-stage active-set algorithm for bound-constrained optimization
A fast active set block coordinate descent algorithm for \(\ell_1\)-regularized least squares
Strong Rules for Discarding Predictors in Lasso-Type Problems
Robust regression with compositional covariates
Minimization over the \(\ell_1\)-ball using an active-set non-monotone projected gradient
Primal path algorithm for compositional data analysis
Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search

Cited In (3)

A decomposition method for lasso problems with zero-sum constraint
as-zsl
Laplacian-based semi-supervised learning in multilayer hypergraphs by coordinate descent

Uses Software

Gurobi
LIBSVM
FPC_AS
DeepCoDA
ConstrainedLasso

This page was built for publication: A decomposition method for Lasso problems with zero-sum constraint

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2106751)