Conic relaxations for semi-supervised support vector machines

DOI10.1007/S10957-015-0843-4zbMATHOpenAlexMaRDI QIDQ289094FDO

Authors Xin Yan, Yanqin Bai

Publication date 27 May 2016

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10957-015-0843-4

zbMATH Keywords

completely positive programmingconvex conic relaxationdoubly nonnegative relaxationsemi-definite relaxationsemi-supervised support vector machines

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Semidefinite programming (90C22) Mixed integer programming (90C11)

Recommendations

• A new conic approach to semisupervised support vector machines
• On convergence rate of a convex relaxation of semisupervised support vector machines
• SDP relaxation for semi-supervised support vector machine
• A class of semi-supervised support vector machines by DC programming
• A proximal quadratic surface support vector machine for semi-supervised binary classification

Cites work

• scientific article; zbMATH DE number 5957380 (Why is no real title available?)
• scientific article; zbMATH DE number 4171117 (Why is no real title available?)
• scientific article; zbMATH DE number 1302171 (Why is no real title available?)
• Alternating direction augmented Lagrangian methods for semidefinite programming
• Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
• Burer's key assumption for semidefinite and doubly nonnegative relaxations
• Consensus proximal support vector machine for classification problems with sparse solutions
• New SDP models for protein homology detection with semi-supervised SVM
• On doubly positive semidefinite programming relaxations
• On the copositive representation of binary and continuous nonconvex quadratic programs
• Optimization techniques for semi-supervised support vector machines
• Optimizing a polyhedral-semidefinite relaxation of completely positive programs
• SDP relaxation for semi-supervised support vector machine
• Some NP-complete problems in quadratic and nonlinear programming
• Support vector machine polyhedral separability in semisupervised learning
• Support-vector networks

Cited in

(8)

• A novel kernel-free nonlinear SVM for semi-supervised classification in disease diagnosis
• A proximal quadratic surface support vector machine for semi-supervised binary classification
• SDP relaxation for semi-supervised support vector machine
• A new conic approach to semisupervised support vector machines
• Corporate and personal credit scoring via fuzzy non-kernel SVM with fuzzy within-class scatter
• On convergence rate of a convex relaxation of semisupervised support vector machines
• A class of semi-supervised support vector machines by DC programming
• A new branch-and-bound approach to semi-supervised support vector machine

Describes a project that uses

Uses Software

• CVX

This page was built for publication: Conic relaxations for semi-supervised support vector machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q289094)