A row-action method for convex programming (Q1330898)
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 row-action method for convex programming |
scientific article; zbMATH DE number 617335
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A row-action method for convex programming |
scientific article; zbMATH DE number 617335 |
Statements
A row-action method for convex programming (English)
0 references
10 August 1994
0 references
A method of row-action type for the minimizing of a convex program with a strictly convex objective function is presented. At each iteration a subproblem is solved consisting of minimization of the objective function subject to one or two linear equations. Convergence of the algorithm is established and comparisons with other row-action algorithms are maked.
0 references
method of row-action type
0 references
strictly convex objective function
0 references
0 references
0.9371884
0 references
0.93532264
0 references
0.88667953
0 references
0 references
0.87212354
0 references
