Sum-of-Squares Relaxations in Robust DC Optimization and Feature Selection

Open issues and recent advances in DC programming and DCA

(2023) Hoai An Le Thi et al.   JOURNAL OF GLOBAL OPTIMIZATION

Robust Optimization and Data Classification for Characterization of Huntington Disease Onset via Duality Methods

(2021) Daniel Woolnough et al.   JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS

A comprehensive survey on support vector machine classification: Applications, challenges and trends

(2020) Jair Cervantes et al.   NEUROCOMPUTING

Feature selection in SVM via polyhedral k-norm

(2019) Manlio Gaudioso et al.   Optimization Letters

A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints

(2019) N.H. Chieu et al.   OPERATIONS RESEARCH LETTERS

On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint

(2017) Jae Hyoung Lee et al.   MATHEMATICAL PROGRAMMING

DC formulations and algorithms for sparse optimization problems

(2017) Jun-ya Gotoh et al.   MATHEMATICAL PROGRAMMING

SOS-Convex Semialgebraic Programs and its Applications to Robust Optimization: A Tractable Class of Nonsmooth Convex Optimization

(2017) N. H. Chieu et al.   Set-Valued and Variational Analysis

Generalized Farkas’ lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization

(2015) V. Jeyakumar et al.   JOURNAL OF GLOBAL OPTIMIZATION

Lagrange-type duality in DC programming

(2014) Ryohei Harada et al.   JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS

Feature selection in machine learning: an exact penalty approach using a Difference of Convex function Algorithm

(2014) Hoai An Le Thi et al.   MACHINE LEARNING

Feature selection for linear SVMs under uncertain data: Robust optimization based on difference of convex functions algorithms

(2014) Hoai An Le Thi et al.   NEURAL NETWORKS

Robust SOS-convex polynomial optimization problems: exact SDP relaxations

(2014) V. Jeyakumar et al.   Optimization Letters

A new class of alternative theorems for SOS-convex inequalities and robust optimization

(2013) V. Jeyakumar et al.   APPLICABLE ANALYSIS

Dual Semidefinite Programs Without Duality Gaps for a Class of Convex Minimax Programs

(2013) V. Jeyakumar et al.   JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS

A Complete Characterization of the Gap between Convexity and SOS-Convexity

(2013) Amir Ali Ahmadi et al.   SIAM JOURNAL ON OPTIMIZATION

Exact SDP relaxations for classes of nonlinear semidefinite programming problems

(2012) V. Jeyakumar et al.   OPERATIONS RESEARCH LETTERS

Simultaneous classification and feature selection via convex quadratic programming with application to HIV-associated neurocognitive disorder assessment

(2010) Michelle Dunbar et al.   EUROPEAN JOURNAL OF OPERATIONAL RESEARCH

Convexity in SemiAlgebraic Geometry and Polynomial Optimization

(2009) Jean B. Lasserre   SIAM JOURNAL ON OPTIMIZATION

From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images

(2009) Alfred M. Bruckstein et al.   SIAM REVIEW

Semidefinite representation of convex sets

(2008) J. William Helton et al.   MATHEMATICAL PROGRAMMING

Feature selection for the SVM: An application to hypertension diagnosis

(2006) Chao-Ton Su et al.   EXPERT SYSTEMS WITH APPLICATIONS