A combination of potential reduction steps and steepest descent steps for solving convex programming problems (Q5317840): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1002/nla.268 / rank | |||
| Property / cites work | |||
| Property / cites work: Q3142434 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Matrix Balancing on a Massively Parallel Connection Machine / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/NLA.268 / rank | |||
Normal rank | |||
Latest revision as of 16:41, 30 December 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
