?url_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.relation=https%3A%2F%2Fpure.iiasa.ac.at%2Fid%2Feprint%2F4122%2F&rft.title=Free-Steering+Relaxation+Methods+for+Problems+with+Strictly+Convex+Costs+and+Linear+Constraints&rft.creator=Kiwiel%2C+K.&rft.description=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.%2C+entropy+maximization%2C+quadratic+programming%2C+network+flows)%2C+because+they+are+simple%2C+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%2C+Censor+and+Lent%2C+De+Pierro+and+Iusem%2C+and+Luo+and+Tseng%2C+and+complements+that+of+Bertsekas+and+Tseng.&rft.publisher=WP-94-089&rft.date=1994-09&rft.type=Monograph&rft.type=NonPeerReviewed&rft.format=text&rft.language=en&rft.identifier=https%3A%2F%2Fpure.iiasa.ac.at%2Fid%2Feprint%2F4122%2F1%2FWP-94-089.pdf&rft.identifier=++Kiwiel%2C+K.++(1994).++Free-Steering+Relaxation+Methods+for+Problems+with+Strictly+Convex+Costs+and+Linear+Constraints.+++IIASA+Working+Paper.+IIASA%2C+Laxenburg%2C+Austria%3A+WP-94-089+++++