Convexification procedures and decomposition methods for nonconvex optimization problems |
| |
Authors: | D. P. Bertsekas |
| |
Affiliation: | (1) Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, Massachusetts |
| |
Abstract: | In order for primal-dual methods to be applicable to a constrained minimization problem, it is necessary that restrictive convexity conditions are satisfied. In this paper, we consider a procedure by means of which a nonconvex problem is convexified and transformed into one which can be solved with the aid of primal-dual methods. Under this transformation, separability of the type necessary for application of decomposition algorithms is preserved. This feature extends the range of applicability of such algorithms to nonconvex problems. Relations with multiplier methods are explored with the aid of a local version of the notion of a conjugate convex function.This work was carried out at the Coordinated Science Laboratory, University of Illinois, Urbana, Illinois, and was supported by the National Science Foundation under Grant ENG 74-19332. |
| |
Keywords: | Primal-dual methods convexification procedures decomposition methods multiplier methods local convex conjugate functions |
本文献已被 SpringerLink 等数据库收录! |
|