A row-action method for convex programming
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.
scientific article; zbMATH DE number 617335
scientific article