Constraint Aggregation Principle in Convex Optimization.
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. <p> 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.
Year of publication: |
1995-02
|
---|---|
Authors: | Ermoliev, Y.M. ; Kryazhimskii, A.V. ; Ruszczynski, A. |
Institutions: | International Institute for Applied Systems Analysis (IIASA) |
Saved in:
freely available
Saved in favorites
Similar items by person
-
Guaranteed Optimization in Insurance of Catastrophic Risks.
Digas, B.V., (1998)
-
Constraint Aggregation in Infinite-Dimensional Spaces and Applications.
Kryazhimskii, A.V., (1997)
-
On Optimal Allocation of Indivisibles Under Uncertainty.
Norkin, V.I., (1994)
- More ...