A convergence analysis for a convex version of Dikin's algorithm (Q1915918)
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 convergence analysis for a convex version of Dikin's algorithm |
scientific article; zbMATH DE number 894990
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A convergence analysis for a convex version of Dikin's algorithm |
scientific article; zbMATH DE number 894990 |
Statements
A convergence analysis for a convex version of Dikin's algorithm (English)
0 references
1 July 1996
0 references
interior point methods
0 references
Dikin's algorithm
0 references
linearly constrained smooth convex programs
0 references
second-order approximation of the objective function
0 references
\(\varepsilon\)-optimal solution
0 references
0 references
0 references
0 references
0.90602934
0 references
0.9020513
0 references
0.8974981
0 references
0.89649665
0 references
0.89562947
0 references
0.89207083
0 references
0.8918249
0 references
