Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines (Q6051312): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A DC programming approach for feature selection in support vector machines learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slope meets Lasso: improved oracle bounds and optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer programming models for feature selection: new extensions and a randomized solution algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best subset selection via a modern optimization lens / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logistic regression: from art to science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational study of a family of mixed-integer quadratic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: SLOPE-adaptive variable selection via convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feature Selection via Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable signal recovery from incomplete and inaccurate measurements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decoding by Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2755103 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5159402 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093206 / 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: Q5148366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feature selection in SVM via polyhedral \(k\)-norm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangian relaxation for SVM feature selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deforming $||.||_{1}$ into $||.||_{\infty}$ via Polyhedral Norms: A Pedestrian Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: DC formulations and algorithms for sparse optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: 10.1162/153244303322753616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3720308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalent Lipschitz surrogates for zero-norm and rank optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feature selection for support vector machines via mixed integer linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A rank-corrected procedure for matrix completion with fixed basis coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concave programming for minimizing the zero-norm over polyhedral sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feature subset selection for logistic regression via mixed integer optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimality conditions for nonconvex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supersparse linear integer models for optimized medical scoring systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear best approximation using a class of polyhedral norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: 10.1162/153244303322753751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Moreau--Yosida Regularization of the Vector $k$-Norm Related Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of $\ell_{1-2}$ for Compressed Sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly unbiased variable selection under minimax concave penalty / rank
 
Normal rank

Revision as of 06:52, 3 August 2024

scientific article; zbMATH DE number 7752374
Language Label Description Also known as
English
Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines
scientific article; zbMATH DE number 7752374

    Statements

    Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines (English)
    0 references
    0 references
    0 references
    0 references
    19 October 2023
    0 references
    global optimization
    0 references
    sparse optimization
    0 references
    cardinality constraint
    0 references
    \(k\)-norm
    0 references
    support vector machine
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references