Dual Applications of Proximal Bundle Methods, Including Lagrangian Relaxation of Nonconvex Problems

We exhibit useful properties of proximal bundle methods for finding $\min_Sf$, where f and S are convex. We show that they asymptotically find objective subgradients and constraint multipliers involved in optimality conditions, multipliers of objective pieces for max-type functions, and primal and dual solutions in Lagrangian decomposition of convex programs. When applied to Lagrangian relaxation of nonconvex programs, they find solutions to relaxed convexified versions of such programs. Numerical results are presented for unit commitment in power production scheduling.

[1]  Stephen M. Robinson.  Bundle-Based Decomposition: Conditions for Convergence , 1989 .

[2]  H. W. Zaininger,et al.  Synthetic electric utility systems for evaluating advanced technologies. Final report , 1977 .

[3]  Dimitri P. Bertsekas,et al.  Constrained Optimization and Lagrange Multiplier Methods , 1982 .

[4]  Godwin C. Ovuworie,et al.  Mathematical Programming: Structures and Algorithms , 1979 .

[5]  D. Bertsekas,et al.  Optimal short-term scheduling of large-scale power systems , 1981, 1981 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[6]  C. Lemaréchal.  An extension of davidon methods to non differentiable problems , 1975 .

[7]  K. Kiwiel.  A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems , 1989 .

[8]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

[9]  M. Wagner,et al.  Generalized Linear Programming Solves the Dual , 1976 .

[10]  Leon S. Lasdon,et al.  Optimization Theory of Large Systems , 1970 .

[11]  Hanif D. Sherali,et al.  Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs , 1996, Oper. Res. Lett..

[12]  J. J. Shaw,et al.  A direct method for security-constrained unit commitment , 1995 .

[13]  Krzysztof C. Kiwiel,et al.  Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization , 1991, Math. Program..

[14]  Werner Römisch,et al.  Solving the Unit Commitment Problem in Power Generation by Primal and Dual Methods , 1997 .

[15]  N. S. Barnett,et al.  Private communication , 1969 .

[16]  John A. Muckstadt,et al.  An Application of Lagrangian Relaxation to Scheduling in Power-Generation Systems , 1977, Oper. Res..

[17]  R. Mifflin.  A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization , 1982 .

[18]  Claude Lemaréchal,et al.  Convergence of some algorithms for convex minimization , 1993, Math. Program..

[19]  Stephen M. Robinson.  Bundle-based decomposition: Description and preliminary results , 1986 .

[20]  B. Fardanesh,et al.  Two-step optimal thermal generation scheduling , 1986, Autom..

[21]  Naum Zuselevich Shor,et al.  Minimization Methods for Non-Differentiable Functions , 1985, Springer Series in Computational Mathematics.

[22]  Krzysztof C. Kiwiel,et al.  Proximity control in bundle methods for convex nondifferentiable minimization , 1990, Math. Program..

[23]  Michael Patriksson,et al.  Ergodic, primal convergence in dual subgradient schemes for convex programming , 1999, Mathematical programming.

[24]  C. Lemaréchal,et al.  Bundle methods applied to the unit-commitment problem , 1996 .

[25]  Francisco D. Galiana,et al.  Towards a more rigorous and practical unit commitment by Lagrangian relaxation , 1988 .

[26]  K. Kiwiel.  Approximations in proximal bundle methods and decomposition of convex programs , 1995 .

[27]  Gerald B. Sheblé,et al.  Unit commitment literature synopsis , 1994 .

[28]  James V. Burke,et al.  Characterization of solution sets of convex programs , 1991, Oper. Res. Lett..

[29]  K. Kiwiel.  A Cholesky dual method for proximal piecewise linear programming , 1994 .

[30]  Krzysztof C. Kiwiel,et al.  Restricted Step and Levenberg-Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization , 1996, SIAM J. Optim..

[31]  C. Lemaréchal.  Nonsmooth Optimization and Descent Methods , 1978 .

[32]  Claude Lemaréchal,et al.  Variable metric bundle methods: From conceptual to implementable forms , 1997, Math. Program..

[33]  M. Patriksson,et al.  Ergodic convergence in subgradient optimization , 1998 .

[34]  A. J. Svoboda,et al.  A new unit commitment method , 1997 .

[35]  Stefan Feltenmark.  On optimization of power production , 1997 .

[36]  Jonathan F. Bard,et al.  Short-Term Scheduling of Thermal-Electric Generators Using Lagrangian Relaxation , 1988, Oper. Res..

[37]  S. V. Rzhevskii.  Constrained ε-subgradient method for simultaneous solution of the primal and dual problems of convex programming , 1989 .

[38]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[39]  C. Lemaréchal,et al.  ON A BUNDLE ALGORITHM FOR NONSMOOTH OPTIMIZATION , 1981 .

[40]  Nesa L'abbe Wu,et al.  Linear programming and extensions , 1981 .

[41]  P. Wolfe,et al.  A METHOD OF CONJUGATE SUBGRADIENTS FOR , 1975 .

[42]  Anastasios G. Bakirtzis,et al.  A genetic algorithm solution to the unit commitment problem , 1996 .

[43]  P. Wolfe.  Note on a method of conjugate subgradients for minimizing nondifferentiable functions , 1974 .

[44]  D. Bertsekas,et al.  Optimal short-term scheduling of large-scale power systems , 1981, CDC 1981.

[45]  J. Zowe,et al.  A combination of the bundle approach and the trust region concept , 1988 .

[46]  J. Hiriart-Urruty,et al.  Convex analysis and minimization algorithms , 1993 .