Polynomial Convergence of Primal-Dual Algorithms for Semidefinite Programming Based on the Monteiro and Zhang Family of Directions (Q4210332): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 14:46, 5 March 2024
scientific article; zbMATH DE number 1200959
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial Convergence of Primal-Dual Algorithms for Semidefinite Programming Based on the Monteiro and Zhang Family of Directions |
scientific article; zbMATH DE number 1200959 |
Statements
Polynomial Convergence of Primal-Dual Algorithms for Semidefinite Programming Based on the Monteiro and Zhang Family of Directions (English)
0 references
21 September 1998
0 references
semidefinite programming
0 references
interior-point methods
0 references
polynomial complexity
0 references
path-following methods
0 references
primal-dual methods
0 references
convergence
0 references
