A polynomial time constraint-reduced algorithm for semidefinite optimization problems (Q493064)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial time constraint-reduced algorithm for semidefinite optimization problems |
scientific article |
Statements
A polynomial time constraint-reduced algorithm for semidefinite optimization problems (English)
0 references
11 September 2015
0 references
semidefinite programming
0 references
interior point methods
0 references
constraint reduction
0 references
primal dual infeasible
0 references
polynomial complexity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
