Decomposition via Alternating Linearization

Kiwiel K, Rosa CH, & Ruszczynski A (1995). Decomposition via Alternating Linearization. IIASA Working Paper. IIASA, Laxenburg, Austria: WP-95-051

[img]
Preview
Text
WP-95-051.pdf

Download (755kB) | Preview

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.

Item Type: Monograph (IIASA Working Paper)
Research Programs: Optimization under Uncertainty (OPT)
Depositing User: IIASA Import
Date Deposited: 15 Jan 2016 02:06
Last Modified: 23 Jul 2016 04:34
URI: http://pure.iiasa.ac.at/4541

Actions (login required)

View Item View Item

International Institute for Applied Systems Analysis (IIASA)
Schlossplatz 1, A-2361 Laxenburg, Austria
Phone: (+43 2236) 807 0 Fax:(+43 2236) 71 313