A globally convergent primal-dual interior point algorithm for convex programming (Q1330897): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:39, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A globally convergent primal-dual interior point algorithm for convex programming |
scientific article |
Statements
A globally convergent primal-dual interior point algorithm for convex programming (English)
0 references
10 August 1994
0 references
interior-point methods
0 references
Karmarkar's algorithm
0 references
potential reduction algorithms
0 references
global convergence
0 references
primal-dual interior point algorithms
0 references
linearly constrained convex programming
0 references
Armijo stepsize rule
0 references
convergence analysis
0 references
