On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming (Q4389196): 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.1137/s1052623495296115 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1985984741 / rank | |||
Normal rank | |||
Latest revision as of 10:00, 30 July 2024
scientific article; zbMATH DE number 1151235
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming |
scientific article; zbMATH DE number 1151235 |
Statements
On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming (English)
0 references
12 May 1998
0 references
semidefinite programming
0 references
primal-dual interior-point methods
0 references
complexity analysis
0 references
linear programming
0 references
