| Date: |
1997 |
| 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 surrogate 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. Next, dual interpretation of the method is provided and application to decomposable problems is discussed. Finally, a numerical illustration is given. . |
| Rights: |
Tots els drets reservats.  |
| Language: |
Anglès |
| Document: |
Article ; recerca ; Versió publicada |
| Subject: |
Nonsmooth optimization ;
Surrogate constraints ;
Subgradient methods ;
Decomposition |
| Published in: |
Mathematical Programming, vol. 76 n. 3 (1997) p. 353-372, ISSN 0025-5610 |
guest ::
UAB restricted access
