A wide neighbourhood interior-point method with iteration-complexity bound for semidefinite programming (Q3066932): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:47, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A wide neighbourhood interior-point method with iteration-complexity bound for semidefinite programming |
scientific article |
Statements
A wide neighbourhood interior-point method with iteration-complexity bound for semidefinite programming (English)
0 references
20 January 2011
0 references
semidefinite programming
0 references
path-following interior-point method
0 references
iteration-complexity bound
0 references
