A cutting plane algorithm for semi-definite programming problems with applications to failure discriminant analysis (Q697556)

The authors propose a new cutting plane algorithm for solving a class of semi-definite programming problems with a small number of variables and a large number of constraints. The convergence property of the algorithm is proved under a simplifying assumption. Some numerical results are shown by applying the algorithm to solve the failure discrimination problems and randomly generated problems.