Sum-of-squares relaxations in robust DC optimization and feature selection (Q6142071): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s10957-023-02312-2 / rank
Normal rank
 
Property / cites work
 
Property / cites work: A Complete Characterization of the Gap between Convexity and SOS-Convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3182207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Modern 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: From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images / rank
 
Normal rank
Property / cites work
 
Property / cites work: A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Nonlinear Fractional Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous classification and feature selection via convex quadratic programming with application to HIV-associated neurocognitive disorder assessment / 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: DC formulations and algorithms for sparse optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrange-type duality in DC programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite representation of convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753173 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new class of alternative theorems for SOS-convex inequalities and robust optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact SDP relaxations for classes of nonlinear semidefinite programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust SOS-convex polynomial optimization problems: exact SDP relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual semidefinite programs without duality gaps for a class of convex minimax programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Introduction to Polynomial and Semi-Algebraic Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity in SemiAlgebraic Geometry and Polynomial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality in D. C. programming: The case of several D. C. constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust optimization and data classification for characterization of Huntington disease onset via duality methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5214210 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10957-023-02312-2 / rank
 
Normal rank

Latest revision as of 18:50, 30 December 2024

scientific article; zbMATH DE number 7794716
Language Label Description Also known as
English
Sum-of-squares relaxations in robust DC optimization and feature selection
scientific article; zbMATH DE number 7794716

    Statements

    Sum-of-squares relaxations in robust DC optimization and feature selection (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 January 2024
    0 references
    DC optimization
    0 references
    SOS-convex polynomials
    0 references
    robust optimization
    0 references
    semi-definite programs
    0 references
    robust feature selection
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references