Article ID: | iaor19961359 |
Country: | Netherlands |
Volume: | 64 |
Issue: | 2 |
Start Page Number: | 149 |
End Page Number: | 171 |
Publication Date: | Apr 1994 |
Journal: | Mathematical Programming (Series A) |
Authors: | Iusem Alfredo N. |
The authors present a new method for minimizing a strictly convex function subject to general convex constraints. Constraints are used one at a time, no changes are made in the constraint functions (thus the row-action nature of the algorithm) and 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 the method is compared with other row-action algorithms for several relevant particular cases.