Sum-of-squares relaxations in robust DC optimization and feature selection
From MaRDI portal
Publication:6142071
DOI10.1007/s10957-023-02312-2MaRDI QIDQ6142071
Vaithilingam Jeyakumar, Yingkun Huang, Jae Hyoung Lee, Gue Myung Lee
Publication date: 25 January 2024
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
robust optimizationDC optimizationSOS-convex polynomialssemi-definite programsrobust feature selection
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Fractional programming (90C32)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization
- Dual semidefinite programs without duality gaps for a class of convex minimax programs
- Lagrange-type duality in DC programming
- Semidefinite representation of convex sets
- Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms
- Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm
- Simultaneous classification and feature selection via convex quadratic programming with application to HIV-associated neurocognitive disorder assessment
- Duality in D. C. programming: The case of several D. C. constraints
- SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization
- DC formulations and algorithms for sparse optimization problems
- On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint
- Exact SDP relaxations for classes of nonlinear semidefinite programming problems
- Robust optimization and data classification for characterization of Huntington disease onset via duality methods
- Robust SOS-convex polynomial optimization problems: exact SDP relaxations
- A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints
- Feature selection in SVM via polyhedral \(k\)-norm
- Lectures on Modern Convex Optimization
- A Complete Characterization of the Gap between Convexity and SOS-Convexity
- An Introduction to Polynomial and Semi-Algebraic Optimization
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Convexity in SemiAlgebraic Geometry and Polynomial Optimization
- Feature Selection via Mathematical Programming
- A new class of alternative theorems for SOS-convex inequalities and robust optimization
- On Nonlinear Fractional Programming
- Convex Analysis
This page was built for publication: Sum-of-squares relaxations in robust DC optimization and feature selection