Free-Steering Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints
We consider dual coordinate ascent methods for minimizing a strictly convex (possibly nondifferentiable) function subject to linear constraints. Such methods are useful in large-scale applications (e.g., entropy maximization, quadratic programming, network flows), because they are simple, can exploit sparsity and in certain cases are highly parallelizable. We establish their global convergence under weak conditions and a free-steering order of relaxation. Previous comparable results were restricted to special problems with separable costs and equality constraints. Our convergence framework unifies to a certain extent the approaches of Bregman, Censor and Lent, De Pierro and Iusem, and Luo and Tseng, and complements that of Bertsekas and Tseng.
|Date of creation:||Sep 1994|
|Contact details of provider:|| Postal: A-2361 Laxenburg|
Web page: http://www.iiasa.ac.at/Publications/Catalog/PUB_ONLINE.html
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Lamond, B. & Stewart, N. F., 1981. "Bregman's balancing method," Transportation Research Part B: Methodological, Elsevier, vol. 15(4), pages 239-248, August.
When requesting a correction, please mention this item's handle: RePEc:wop:iasawp:wp94089. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel)
If references are entirely missing, you can add them using this form.