A cutting plane algorithm for semi-definite programming problems with applications to failure discriminant analysis
作者:
Highlights:
•
摘要
We will propose a new cutting plane algorithm for solving a class of semi-definite programming problems (SDP) with a small number of variables and a large number of constraints. Problems of this type appear when we try to classify a large number of multi-dimensional data into two groups by a hyper-ellipsoidal surface. Among such examples are cancer diagnosis, failure discrimination of enterprises. Also, a certain class of option pricing problems can be formulated as this type of problem. We will show that the cutting plane algorithm is much more efficient than the standard interior point algorithms for solving SDP.
论文关键词:Semi-definite programming,Ellipsoidal separation,Cutting plane method,Failure discriminant analysis,Cancer diagnosis
论文评审过程:Received 22 December 2000, Revised 20 July 2001, Available online 24 May 2002.
论文官网地址:https://doi.org/10.1016/S0377-0427(02)00424-7