Skip to main content
SpringerLink
Log in

On a decomposition method for nonconvex global optimization

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

A rigorous foundation is presented for the decomposition method in nonconvex global optimization, including parametric optimization, partly convex, partly monotonic, and monotonic/linear optimization. Incidentally, some errors in the recent literature on this subject are pointed out and fixed.

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

Access this article

Log in via an institution

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

  1. Ben-Tal A., et al. (1994) Global minimization by reducing the duality gap. Math. Program. 63, 193–212

    Article  MathSciNet  Google Scholar 

  2. Dür M. (2001) Dual bounding procedures lead to convergent branch and bound algorithms. Math. Program. Ser. A 91, 117–125

    MATH  Google Scholar 

  3. Dür M., Horst R. (2002) Lagrange duality and partitioning techniques in nonconvex global optimization. J. Optim. Theory Appl. 95, 347–369

    Article  Google Scholar 

  4. Ekeland I., Temam R. (1976) Convex analysis and variational problems. North-Holland, Amsterdam, American Elsevier, New York

  5. Horst R., Thoai N.V. (2005) Duality bound methods in global optimization. In: Audet C., Hansen P., Savard G. (eds) Essays and Surveys in Global Optimization. Springer, Berlin Heidelberg New York, pp. 79–105

    Chapter  Google Scholar 

  6. Thoai N.V. (2000) Duality bound method for the general quadratic programming problem with quadratic constraints. J. Optim. Theory Appl. 107, 331–354

    Article  MATH  MathSciNet  Google Scholar 

  7. Thoai N.V. (2002) Convergence of duality bound method in partly convex programming. J. Global Optim. 22, 263–270

    Article  MATH  MathSciNet  Google Scholar 

  8. Thoai N.V. (2002) Convergence and application of a decomposition method using duality bounds for nonconvex global optimization. J. Optim. Theory Appl. 113, 165–193

    Article  MATH  MathSciNet  Google Scholar 

  9. Tuy H. (2004) Minimax theorems revisited. Acta Math. Vietnamica 29, 217–229

    MATH  MathSciNet  Google Scholar 

  10. Tuy, H.: Convex Analysis and Global Optimization. Kluwer (1998)

  11. Tuy H. (2005) On solving nonconvex global optimization by reducing the duality gap. J. Global Optim. 32, 349–365

    Article  MATH  MathSciNet  Google Scholar 

  12. Tuy, H.: A parametric minimax theorem with applications. Submitted

  13. Tuy H. (2000) Monotonic optimization: problems and solution methods. SIAM J. Optim. 11(2): 464–494

    Article  MATH  MathSciNet  Google Scholar 

  14. Tuy H., Al-Khayyal F., Thach P.T. (2005) Monotonic optimization: branch and cut methods. In: Audet C., Hansen P., Savard G. (eds) Essays and Surveys in Global Optimization. Springer, Berlin Heidelberg New York, pp. 39–78

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, 18 Hoang Quoc Viet Road, 10307, Hanoi, Vietnam

    Hoang Tuy

Authors
  1. Hoang Tuy
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hoang Tuy.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tuy, H. On a decomposition method for nonconvex global optimization. Optimization Letters 1, 245–258 (2007). https://doi.org/10.1007/s11590-006-0025-2

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-006-0025-2

Keywords

Search

Navigation