A polynomial time constraint-reduced algorithm for semidefinite optimization problems (Q493064): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q182673 |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: LINPACK / rank | |||
Normal rank | |||
Revision as of 13:12, 28 February 2024
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
