Relaxation methods for problems with strictly convex separable costs and linear constraints
Authors:
- 1 October 1987
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 38 (3) , 303-321
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Distributed Asynchronous Relaxation Methods for Convex Network Flow ProblemsSIAM Journal on Control and Optimization, 1987
- On the convergence of a block successive over-relaxation method for a class of linear complementarity problems1982
- On the convergence of sequential minimization algorithmsJournal of Optimization Theory and Applications, 1973
- On search directions for minimization algorithmsMathematical Programming, 1973
- Convex Analysis1970
- Note—A Note on the Cyclic Coordinate Ascent MethodManagement Science, 1970