Skip to main content
Log in

Convergence of duality bound method in partly convex programming

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

We discuss the convergence of a decomposition branch-and-bound algorithm using Lagrangian duality for partly convex programs in the general form. It is shown that this decomposition algorithm has all convergence properties as any known branch-and-bound algorithm in global optimization under usual assumptions. Thus, some strict assumptions discussed in the literature are avoidable.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Bank, B., Guddat, J., Klatte, D., Kummer, B. and Tammer, K. (1983), Nonlinear Parametric Optimization. Birkhaeuser,Basel.

  • Ben-Tal, A., Eiger, G. and Gershovitz, V. (1994), GlobalMinimization by Reducing the Duality Gap. Mathematical Programming 63: 193–212.

    Google Scholar 

  • Duer, M. (1999), Duality in Global Optimization: Optimality Conditions and Algorithmical Aspects Ph.D. Thesis, University of Trier.

  • Duer, M. and Horst, R. (1997), Lagrange Duality and Partioning Techniques in Nonconvex Global Optimization. Journal of Optimization Theory and Applications 95: 347–369.

    Google Scholar 

  • Duer, M., Horst, R. and Thoai, N.V. (2001), Solving Sum-of-Ratios Fractional Programs Using Efficient Points Optimization 49: 447–466.

    Google Scholar 

  • Geoffrion, A.M. (1971), Duality in Nonlinear Programming: A Simplified Application-Oriented Development. SIAM Review 13, 1–37.

    Google Scholar 

  • Mangasaian, O.L. (1979), Nonlinear Programming. Robert E. Krieger, Huntington, New York.

    Google Scholar 

  • Thoai, N.V. (1997), On Convergence and Application of a Decomposition Method Using Duality Bounds for Nonconvex Global Optimization. Research Report Nr. 97–24, University of Trier, Germany. Forthcoming in Journal of Optimization Theory and Applications.

    Google Scholar 

  • Thoai, N.V. (2000), Duality Bound Methods for the General Quadratic Programming Problem with Quadratic Constraints Journal of Optimization Theory and Applications 107, 331–354.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Thoai, N.V. Convergence of duality bound method in partly convex programming. Journal of Global Optimization 22, 263–270 (2002). https://doi.org/10.1023/A:1013871532570

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1013871532570

Navigation