Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: iterative process (Q2672023)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: iterative process |
scientific article; zbMATH DE number 7538080
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: iterative process |
scientific article; zbMATH DE number 7538080 |
Statements
Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: iterative process (English)
0 references
8 June 2022
0 references
linear semidefinite programming problem
0 references
primal-dual Newton method
0 references
iterative process
0 references
steepest descent
0 references
0 references
0 references
0.96384186
0 references
0.95607287
0 references
0.9120985
0 references
0.90159565
0 references
0.89980817
0 references
0.8976647
0 references
0.8967321
0 references
0.89559585
0 references
