A combination of potential reduction steps and steepest descent steps for solving convex programming problems (Q5317840): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Revision as of 19:48, 5 March 2024
scientific article; zbMATH DE number 2206691
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
