A cutting plane algorithm for semi-definite programming problems with applications to failure discriminant analysis (Q697556)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A cutting plane algorithm for semi-definite programming problems with applications to failure discriminant analysis |
scientific article; zbMATH DE number 1801724
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A cutting plane algorithm for semi-definite programming problems with applications to failure discriminant analysis |
scientific article; zbMATH DE number 1801724 |
Statements
A cutting plane algorithm for semi-definite programming problems with applications to failure discriminant analysis (English)
0 references
17 September 2002
0 references
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.
0 references
semi-definite programming
0 references
ellipsoidal separation
0 references
cutting plane method
0 references
failure discriminant analysis
0 references
cancer diagnosis
0 references
algorithm
0 references
convergence
0 references
numerical results
0 references
