Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming (Q1434073): 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.1007/s10107-003-0431-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2080605902 / rank | |||
Normal rank | |||
Latest revision as of 20:47, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming |
scientific article |
Statements
Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming (English)
0 references
1 July 2004
0 references
semidefinite programming
0 references
primal-dual
0 references
infeasible interior point method
0 references
inexact search direction
0 references
polynomial complexity
0 references
