Solving convex program via Lagrangian decomposition

Knobloch, Matthias

Kybernetika, Tome 40 (2004) no. 5, pp. 595-610

Abstract (VO)

We consider general convex large-scale optimization problems in finite dimensions. Under usual assumptions concerning the structure of the constraint functions, the considered problems are suitable for decomposition approaches. Lagrangian-dual problems are formulated and solved by applying a well-known cutting-plane method of level-type. The proposed method is capable to handle infinite function values. Therefore it is no longer necessary to demand the feasible set with respect to the non-dualized constraints to be bounded. The paper primarily deals with the description of an appropriate oracle. We first discuss the realization of the oracle under appropriate assumptions for generic convex problems. Afterwards we show that for convex quadratic programs the algorithm of the oracle is universally applicable.

Détail

Classification : 65K05, 90C06, 90C25, 90C30
Keywords: level method; cutting-plane methods; decomposition methods; convex programming; nonsmooth programming

Bibliographie

[1] Auslender A.: Existence of optimal solutions and duality results under weak conditions. Math. Programming 88 (2001), 45–59 | DOI | MR | Zbl

[2] Beer K., Gol’stejn E. G., Sokolov N. A.: Minimization of a nondifferentiable, convex function, defined not everywhere. Optimization 51 (2002), 6, 819–840 | DOI | MR | Zbl

[3] Beer K., Gol’stejn E. G., Sokolov N. A.: Utilization of the Level-method for Primal Decomposition in Linear Programming Problems. Preprint 2000–13, Faculty of Mathematics, University of Technology, Chemnitz 2000

[4] Beer K., Knobloch M.: Utilization of the Level Method for Dual Decomposition in Convex Quadratic Programming. Preprint 2002-4, Faculty of Mathematics, University of Technology, Chemnitz 2002

[5] Belousov E. G.: Introduction to Convex Analysis and Integer Programming (in Russian). Izdatel’stvo Moskovskogo Universiteta, Moskau 1977 | MR

[6] Ekeland I., Témam R.: Convex analysis and variational problems. Unabridged, corrected republication of the 1976 English original. Society for Industrial and Applied Mathematics (SIAM), Philadelphia 1999 | MR | Zbl

[7] Goffin J. L., Vial J. P.: Convex nondifferentiable optimization: a survey focused on the analytic center cutting plane method. Optimization Methods and Software 17 (2002), 5, 805–867 | DOI | MR | Zbl

[8] Kiwiel K. C.: Methods of Descent for Nondifferentiable Optimization. (Lecture Notes in Mathematics 1133), Springer Verlag, Heidelberg 1985 | MR | Zbl

[9] Kiwiel K. C.: Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities. Math. Programming 69B (1995), 89–105 | DOI | MR | Zbl

[10] Lémarechal C., Nemirovskii, A., Nesterov Y.: New variants of bundle methods. Math. Programming 69 (1995), 111–147 | DOI | MR

[11] Nožička F., Guddat J., Hollatz, H., Bank B.: Theorie der linearen parametrischen Optimierung. Akademie Verlag, Berlin 1974 | Zbl

[12] Mifflin R.: An algorithm for constrained optimization with semi-smooth functions. Math. Oper. Res. 2 (1997), 2, 191–207 | DOI | MR

[13] Richter K.: Lösungsverfahren für konvexe Optimierungsaufgaben mit Umrandungsstruktur auf der Grundlage gleichzeitiger primal-dualer Dekomposition. Dissertation, TU Chemnitz 2000 | MR | Zbl

[14] Shor N. Z.: Minimization Methods for Non-differentiable Functions. Springer Verlag, Berlin 1985 | MR | Zbl

[15] Tuy H.: Convex Analysis and Global Optimization. Kluwer, Dordrecht 1998 | MR | Zbl

[16] Unger T.: Erweiterungen der Levelmethode zur Lösung konvexer Optimierungsaufgaben. Dissertation, Shaker Verlag, Aachen 2003