A feasible dual affine scaling steepest descent method for the linear semidefinite programming problem (Q519124)
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: A feasible dual affine scaling steepest descent method for the linear semidefinite programming problem |
scientific article; zbMATH DE number 6700375
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A feasible dual affine scaling steepest descent method for the linear semidefinite programming problem |
scientific article; zbMATH DE number 6700375 |
Statements
A feasible dual affine scaling steepest descent method for the linear semidefinite programming problem (English)
0 references
4 April 2017
0 references
linear semidefinite programming problem
0 references
dual affine scaling method
0 references
steepest descent
0 references
0 references
0.8690415024757385
0 references
0.8470621109008789
0 references
0.8390468955039978
0 references
0.8351567387580872
0 references
0.8336973786354065
0 references
