Free-Steering Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints

K. Kiwiel

Working Papers from International Institute for Applied Systems Analysis

Abstract: 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: 1994-09
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.iiasa.ac.at/Publications/Documents/WP-94-089.ps (application/postscript)
Our link check indicates that this URL is bad, the error code is: 404 Not Found (http://www.iiasa.ac.at/Publications/Documents/WP-94-089.ps [301 Moved Permanently]--> https://www.iiasa.ac.at/Publications/Documents/WP-94-089.ps [301 Moved Permanently]--> https://iiasa.ac.at//Publications/Documents/WP-94-089.ps [302 Found]--> https://iiasa.ac.at/Publications/Documents/WP-94-089.ps)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wop:iasawp:wp94089

Access Statistics for this paper

More papers in Working Papers from International Institute for Applied Systems Analysis Contact information at EDIRC.
Bibliographic data for series maintained by Thomas Krichel ().