Duality Bound Methods in Global Optimization

  • Reiner Horst
  • Nguyen Van Thoai


This article presents an overview of the use of Lagrange-duality bounds within a branch and bound scheme for solving nonconvex global optimization problems. Convergence properties and application possibilities of the method are discussed.


Global Optimization Master Problem Global Optimization Problem Convex Envelope Duality Bound 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Bank, B., Guddat, J., Klatte, D., Kummer, B., and Tammer, K. (1983). Nonlinear Parametric Optimization. Birkhüser, Basel.Google Scholar
  2. Bazaraa, M.S., Sherali, H.D., and Shetty, C.M. (1993). Nonlinear Programming: Theory and Algorithms. 2nd ed., John Wiley & Sons, Inc.Google Scholar
  3. Ben-Tal, A., Eiger, G., and Gershovitz, V. (1994). Global minimization by reducing the duality gap, Mathematical Programming, 63:193–212.MathSciNetCrossRefGoogle Scholar
  4. Berge, C. (1963). Topologigal Spaces. Macmillan, New York.Google Scholar
  5. Charnes, A. and Cooper, W.W. (1962). Programming with linear fractional functionals. Naval Research Logistics Quarterly, 9:181–186.MathSciNetGoogle Scholar
  6. Dantzig, G.B., Folkman, J., and Shapiro, N. (1967). On the continuity of the minimum set of a continuous function. Journal of Mathematical Analysis and Applications, 17:519–548.MathSciNetCrossRefGoogle Scholar
  7. Dür, M. (2001). Dual bounding procedures lead to convergent branch and bound algorithms. Mathematical Programming, 91:117–125.zbMATHMathSciNetGoogle Scholar
  8. Dür, M. (2002). A class of problems where dual bounds beat underestimation bounds. Journal of Global Optimization, 22:49–57.zbMATHCrossRefGoogle Scholar
  9. Dür, M. and Horst, R. (1997). Lagrange duality and partitioning techniques in nonconvex global optimization. Journal of Optimization Theory and Applications, 95:347–369.MathSciNetCrossRefGoogle Scholar
  10. Dür, M., Horst, R., and Thoai, N.V. (2001). Solving sum-of-ratios fractional programs using efficient points. Optimization 49:447–466.MathSciNetGoogle Scholar
  11. Falk, J.E., and Hoffman, K.L. (1976). A successive underestimation method for concave minimization problems. Mathematics of Operations Research, 1:251–259.CrossRefGoogle Scholar
  12. Fiacco, A.V. (1983). Introduction to Sensitivity and Stability Analysis in Nonlinear Programming. Academic Press, New York.Google Scholar
  13. Geoffrion, A.M. (1971). Duality in nonlinear programming: a simplified application-oriented development. SIAM Review, 13:1–37.zbMATHMathSciNetCrossRefGoogle Scholar
  14. Hogan, W.W. (1973). Point-to-set maps in mathematical programming. SIAM Review, 15:591–603.zbMATHMathSciNetCrossRefGoogle Scholar
  15. Horst, R. and Pardalos, P.M. (eds.) (1995). Handbook of Global Optimization. Kluwer Academic Publishers.Google Scholar
  16. Horst, R., Pardalos, P.M., and Thoai, N.V. (2000). Introduction to Global Optimization. 2nd ed., Kluwer, Dordrecht, The Netherlands.Google Scholar
  17. Horst, R. and Tuy, H. (1996). Global Optimization: Deterministic Approaches. 3rd ed., Springer, Berlin.Google Scholar
  18. Le Thi, H.A., Pham, D.T., and Thoai, N.V. (2002). Combination between global and local methods for solving an optimization problem over the efficient set. European Journal of Operations Research, 142:258–270.CrossRefGoogle Scholar
  19. Mangasarian, O.L. (1979). Nonlinear Programming. Robert E. Krieger Publishing Company, Huntington, New York.Google Scholar
  20. Nowak, I. (2000). Dual bounds and optimality cuts for all-quadratic programs with convex constraints. Journal of Global Optimization, 18:337–356.zbMATHCrossRefGoogle Scholar
  21. Shor, N.Z. and Stetsyuk, P.I. (2002). Lagrangian bounds in multiextremal polynomial and discrete optimization problems. Journal of Global Optimization, 23:1–41.MathSciNetCrossRefGoogle Scholar
  22. Thoai, N.V. (2000). Duality bound method for the general quadratic programming problem with quadratic constraints. Journal of Optimization Theory and Applications, 107:331–354.zbMATHMathSciNetCrossRefGoogle Scholar
  23. Thoai, N.V. (2002a) Convergence and application of a decomposition method using duality bounds for nonconvex global optimization. Journal of Optimization Theory and Applications, 113:165–193.zbMATHMathSciNetCrossRefGoogle Scholar
  24. Thoai, N.V. (2002b) Convergence of duality bound method in partly convex programming. Journal of Global Optimization, 22:263–270.zbMATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, Inc. 2005

Authors and Affiliations

  • Reiner Horst
  • Nguyen Van Thoai

There are no affiliations available

Personalised recommendations