A globally convergent primal-dual interior point algorithm for convex programming (Q1330897)
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 globally convergent primal-dual interior point algorithm for convex programming |
scientific article; zbMATH DE number 617334
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A globally convergent primal-dual interior point algorithm for convex programming |
scientific article; zbMATH DE number 617334 |
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
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
