A decomposition method for Lasso problems with zero-sum constraint (Q2106751): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: LIBSVM / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ConstrainedLasso / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: DeepCoDA / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: FPC_AS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4297498189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3952985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 2-coordinate descent method for solving double-sided simplex constrained minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-scale active-set box-constrained optimization method with spectral projected gradients / rank
 
Normal rank
Property / cites work
 
Property / cites work: A family of second-order methods for convex \(\ell _1\)-regularized optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An almost cyclic 2-coordinate descent method for singly linearly constrained problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-stage active-set algorithm for bound-constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An active-set algorithmic framework for non-convex optimization problems over the simplex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization over the \(\ell_1\)-ball using an active-set non-monotone projected gradient / rank
 
Normal rank
Property / cites work
 
Property / cites work: An augmented Lagrangian method exploiting an active-set strategy and second-order information / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Active Set Block Coordinate Descent Algorithm for $\ell_1$-Regularized Least Squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Fitting the Constrained Lasso / rank
 
Normal rank
Property / cites work
 
Property / cites work: Safe Feature Elimination in Sparse Supervised Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of the block nonlinear Gauss-Seidel method under convex constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Active Set Algorithm for Box Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal path algorithm for compositional data analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A second-order method for convex<sub>1</sub>-regularized optimization with active-set prediction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Downlink beamforming for DS-CDMA mobile radio with multimedia services / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable selection in regression with compositional covariates / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of the coordinate descent method for convex differentiable minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust regression with compositional covariates / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of a modified version of SVM<i><sup>light</sup></i>algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3174039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Family of projected descent methods for optimization problems with simple bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regression analysis for microbiome compositional data / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for quadratic ℓ<sub>1</sub>-regularized optimization with a flexible active-set strategy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Rules for Discarding Predictors in Lasso-Type Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The solution path of the generalized lasso / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of a block coordinate descent method for nondifferentiable minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of an active-set method for ℓ<sub>1</sub>minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2896183 / rank
 
Normal rank

Latest revision as of 03:05, 31 July 2024

scientific article
Language Label Description Also known as
English
A decomposition method for Lasso problems with zero-sum constraint
scientific article

    Statements

    A decomposition method for Lasso problems with zero-sum constraint (English)
    0 references
    0 references
    19 December 2022
    0 references
    nonlinear programming
    0 references
    convex programming
    0 references
    constrained Lasso
    0 references
    decomposition methods
    0 references
    active-set methods
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers