Efficient nonconvex sparse group feature selection via continuous and discrete optimization (Q892230): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: sparsenet / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: UCI-ml / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: UNLocBoX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CVX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SLEP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.artint.2015.02.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1996777495 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization with Sparsity-Inducing Penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Point Step Size Gradient Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous analysis of Lasso and Dantzig selector / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative hard thresholding for compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Penalized methods for bi-level variable selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n) algorithm for quadratic knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decoding by Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: De-noising by soft-thresholding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Recovery Algorithms: Sufficient Conditions in Terms of Restricted Isometry Constants / rank
 
Normal rank
Property / cites work
 
Property / cites work: A group bridge approach for variable selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: The benefit of group sparsity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A selective review of group selection in high-dimensional models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5396679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5342672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3265072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative hard thresholding methods for \(l_0\) regularized convex cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>SparseNet</i>: Coordinate Descent With Nonconvex Penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Group Lasso for Logistic Regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Approximate Solutions to Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Likelihood-Based Selection and Sharp Parameter Estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis approach to d. c. programming: Theory, algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the conditions used to prove oracle results for the Lasso / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability inequalities for likelihood ratios and convergence rates of sieve MLEs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Reconstruction by Separable Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Selection and Estimation in Regression with Grouped Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2896066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-stage convex relaxation for feature selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3174050 / rank
 
Normal rank

Latest revision as of 02:03, 11 July 2024

scientific article
Language Label Description Also known as
English
Efficient nonconvex sparse group feature selection via continuous and discrete optimization
scientific article

    Statements

    Efficient nonconvex sparse group feature selection via continuous and discrete optimization (English)
    0 references
    0 references
    0 references
    0 references
    18 November 2015
    0 references
    nonconvex optimization
    0 references
    error bound
    0 references
    discrete optimization
    0 references
    application
    0 references
    EEG data analysis
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers