A wide neighbourhood interior-point method with iteration-complexity bound for semidefinite programming (Q3066932): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/02331930903104382 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2036317548 / rank | |||
Normal rank | |||
Revision as of 02:26, 20 March 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
