A projected‐steepest‐descent potential‐reduction algorithm for convex programming problems (Q5492637)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5064087
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A projected‐steepest‐descent potential‐reduction algorithm for convex programming problems |
scientific article; zbMATH DE number 5064087 |
Statements
A projected‐steepest‐descent potential‐reduction algorithm for convex programming problems (English)
0 references
16 October 2006
0 references
convex programming
0 references
interior point method
0 references
steepest descent method
0 references
primal-dual potential reduction method
0 references
algorithm
0 references
efficiency
0 references
numerical examples
0 references
0.90449720621109
0 references
0.8334844708442688
0 references
0.8235840797424316
0 references
0.820889413356781
0 references
