Constraint Aggregation Principle in Convex Optimization

Ermoliev YM, Kryazhimskiy AV, & Ruszczynski A (1995). Constraint Aggregation Principle in Convex Optimization. IIASA Working Paper. IIASA, Laxenburg, Austria: WP-95-015

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

Download (587kB) | Preview

Abstract

A general constraint aggregation technique is proposed for convex optimization problems. At each iteration a set of convex inequalities and linear equations is replaced by a single inequality formed as a linear combination of the original constraints. After solving the simplified subproblem, new aggregation coefficients are calculated and the iteration continues.

This general aggregation principle is incorporated into a number of specific algorithms. Convergence of the new methods is proved and speed of convergence analyzed. It is shown that in case of linear programming, the method with aggregation has a polynomial complexity. Finally, application to decomposable problems is discussed.

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: 20 Jul 2016 19:37
URI: http://pure.iiasa.ac.at/4577

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