A decomposition method for Lasso problems with zero-sum constraint
From MaRDI portal
(Redirected from Publication:2106751)
Recommendations
- Primal path algorithm for compositional data analysis
- A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
- Exact penalty decomposition method for zero-norm minimization based on MPEC formulation
- A penalty decomposition method for the optimization problem with two 0-norm constraints
- On the Solution of ℓ0-Constrained Sparse Inverse Covariance Estimation Problems
Cites work
- scientific article; zbMATH DE number 3772748 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A New Active Set Algorithm for Box Constrained Optimization
- 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 active set block coordinate descent algorithm for \(\ell_1\)-regularized least squares
- A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation
- A second-order method for convex \(\ell_1\)-regularized optimization with active-set prediction
- A two-stage active-set algorithm for bound-constrained optimization
- Active-set identification with complexity guarantees of an almost cyclic 2-coordinate descent method with Armijo line search
- Algorithms for Fitting the Constrained Lasso
- An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
- An active-set algorithmic framework for non-convex optimization problems over the simplex
- An algorithm for quadratic \(\ell_1\)-regularized optimization with a flexible active-set strategy
- An almost cyclic 2-coordinate descent method for singly linearly constrained problems
- An augmented Lagrangian method exploiting an active-set strategy and second-order information
- An efficient implementation of an active set method for SVMs
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Downlink beamforming for DS-CDMA mobile radio with multimedia services
- Family of projected descent methods for optimization problems with simple bounds
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- Minimization over the \(\ell_1\)-ball using an active-set non-monotone projected gradient
- On the convergence of a modified version of SVMlightalgorithm
- On the convergence of an active-set method for \(\ell_1\) minimization
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- On the convergence of the coordinate descent method for convex differentiable minimization
- Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization
- Primal path algorithm for compositional data analysis
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
- Regression analysis for microbiome compositional data
- Robust regression with compositional covariates
- Safe Feature Elimination in Sparse Supervised Learning
- Strong Rules for Discarding Predictors in Lasso-Type Problems
- The 2-coordinate descent method for solving double-sided simplex constrained minimization problems
- The solution path of the generalized lasso
- Variable selection in regression with compositional covariates
Cited in
(3)
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)
