We exhibit useful properties of proximal bundle methods for finding minSf, 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.
No takes yet. Share an insight, caveat, or question.
Feltenmark et al. (2000) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: