A combination of potential reduction steps and steepest descent steps for solving convex programming problems (Q5317840)
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 combination of potential reduction steps and steepest descent steps for solving convex programming problems |
scientific article; zbMATH DE number 2206691
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A combination of potential reduction steps and steepest descent steps for solving convex programming problems |
scientific article; zbMATH DE number 2206691 |
Statements
A combination of potential reduction steps and steepest descent steps for solving convex programming problems (English)
0 references
21 September 2005
0 references
convex programming
0 references
interior point method
0 references
steepest descent method
0 references
primal-dual potential reduction
0 references
polynomial complexity
0 references
0.9101895093917848
0 references
0.90449720621109
0 references
0.8204284310340881
0 references
0.7959858775138855
0 references
