Decomposition via Alternating Linearization

K. Kiwiel, C.H. Rosa and Andrzej Ruszczynski ()

Working Papers from International Institute for Applied Systems Analysis

Abstract: A new approximate proximal point method for minimizing the sum of two convex functions is introduced. It replaces the original problem by a sequence of regularized subproblems in which the functions are alternately represented by linear models. The method updates the linear models and the prox center, as well as the prox coefficient. It is monotone in terms of the objective values and converges to a solution of the problem, if any. A dual version of the method is derived and analyzed. Applications of the methods to multistage stochastic programming problems are discussed and preliminary numerical experience presented.

Date: 1995-06
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-95-051.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-95-051.ps [301 Moved Permanently]--> https://www.iiasa.ac.at/Publications/Documents/WP-95-051.ps [301 Moved Permanently]--> https://iiasa.ac.at//Publications/Documents/WP-95-051.ps [302 Found]--> https://iiasa.ac.at/Publications/Documents/WP-95-051.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:wp95051

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 ().