论文信息 - Global minimization by reducing the duality gap

Global minimization by reducing the duality gap

We derive a general principle demonstrating that by partitioning the feasible set, the duality gap, existing between a nonconvex program and its lagrangian dual, can be reduced, and in important special cases, even eliminated. The principle can be implemented in a Branch and Bound algorithm which computes an approximate global solution and a corresponding lower bound on the global optimal value. The algorithm involves decomposition and a nonsmooth local search. Numerical results for applying the algorithm to the pooling problem in oil refineries are given.

[1] C. Floudas,et al. Primal-relaxed dual global optimization approach , 1993 .

[2] C. Floudas,et al. A global optimization algorithm (GOP) for certain classes of nonconvex NLPs—I. Theory , 1990 .

[3] Christodoulos A. Floudas,et al. A Decomposition Strategy for Global Optimum Search in the Pooling Problem , 1990, INFORMS J. Comput..

[4] Panos M. Pardalos,et al. A Collection of Test Problems for Constrained Global Optimization Algorithms , 1990, Lecture Notes in Computer Science.

[5] V. Visweswaran,et al. A global optimization algorithm (GOP) for certain classes of nonconvex NLPs—II. Application of theory and test problems , 1990 .

[6] Diethard Klatte,et al. On Procedures for Analysing Parametric Optimization Problems , 1982 .

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

[8] Olvi L. Mangasarian,et al. Nonlinear Programming , 1969 .

[9] U. Shamir,et al. Design of optimal water distribution systems , 1977 .

[10] D. B. Khang,et al. A two‐phase decomposition method for optimal design of looped water distribution networks , 1990 .

[11] Jochem Zowe,et al. A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results , 1992, SIAM J. Optim..