Skip to main content
SpringerLink
Log in

Convex underestimation for posynomial functions of positive variables

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

Abstract

The approximation of the convex envelope of nonconvex functions is an essential part in deterministic global optimization techniques (Floudas in Deterministic Global Optimization: Theory, Methods and Application, 2000). Current convex underestimation algorithms for multilinear terms, based on arithmetic intervals or recursive arithmetic intervals (Hamed in Calculation of bounds on variables and underestimating convex functions for nonconvex functions, 1991; Maranas and Floudas in J Global Optim 7:143–182, (1995); Ryoo and Sahinidis in J Global Optim 19:403–424, (2001)), introduce a large number of linear cuts. Meyer and Floudas (Trilinear monomials with positive or negative domains: Facets of convex and concave envelopes, pp. 327–352, (2003); J Global Optim 29:125–155, (2004)), introduced the complete set of explicit facets for the convex and concave envelopes of trilinear monomials with general bounds. This study proposes a novel method to underestimate posynomial functions of strictly positive variables.

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. Adjiman C.S., Androulakis I.P. and Floudas C.A. (1998). A global optimization method, α BB, for general twice-differentiable NLPs–II. Implementation and Computational results. Comput. Chem. Eng. 22(9): 1159–1179

    Article  Google Scholar 

  2. Adjiman C.S., Dallwig S., Floudas C.A. and Neumaier A. (1998). A global optimization method, α BB, for general twice-differentiable NLPs–I. Theoretical advances. Comput. Chem. Eng. 22(9): 1137–1158

    Article  Google Scholar 

  3. Aggarwal A. and Floudas C.A. (1990). Synthesis of general separation sequences—nonsharp separations. Comput. Chem. Eng. 14(6): 631–653

    Article  Google Scholar 

  4. Akrotirianakis I.G. and Floudas C.A. (2004). Computational experience with a new class of convex underestimators: box constrained NLP problems. J. Global Optim. 29(3): 249–264

    Article  MathSciNet  MATH  Google Scholar 

  5. Akrotirianakis I.G. and Floudas C.A. (2004). A new class of improved convex underestimators for twice continuously differentiable constrained NLPs. J. Global Optim. 30(4): 367–390

    Article  MathSciNet  MATH  Google Scholar 

  6. Avriel M., Diewert W.E., Schaible S. and Zang I. (1988). Generalized Concavity. Plenum Press, New York

    MATH  Google Scholar 

  7. Björk K.J., Lindberg P.O. and Westerlund T. (2003). Some convexifications in global optimization of problems containing signomial terms. Comput. Chem. Eng. 27: 669–679

    Article  Google Scholar 

  8. Caratzoulas S. and Floudas C.A. (2005). A trigonometric convex underestimator for the base functions in Fourier space. J. Optim. Theory Appl. 124(2): 339–362

    Article  MathSciNet  MATH  Google Scholar 

  9. Ciric A.R. and Floudas C.A. (1989). A retrofit approach of heat exchanger networks. Comput. Chem. Eng. 13(6): 703–715

    Article  Google Scholar 

  10. Floudas C.A. (2000). Deterministic Global Optimization: Theory, Methods and Application. Kluwer, Boston

    Google Scholar 

  11. Floudas C.A., Akrotirianakis I.G., Caratzoulas S., Meyer C.A. and Kallrath J. (2005). Global optimization in the 21st century: Advances and challenges. Comput. Chem. Eng. 29: 1185–1202

    Article  Google Scholar 

  12. Hamed, A.S.E.: Calculation of bounds on variables and underestimating convex functions for nonconvex functions. PhD thesis, The George Washington University (1991)

  13. Kokossis A.C. and Floudas C.A. (1994). Optimization of complex reactor networks-II: nonisothermal operation. Chem. Eng. Sci. 49(7): 1037–1051

    Article  Google Scholar 

  14. Li H.L. and Tsai J.F. (2005). Treating free variables in generalized geometric global optimization programs. J. Global Optim. 33(1): 1–13

    Article  MathSciNet  Google Scholar 

  15. Liberti L. and Pantelides C.C. (2003). Convex envelops of monomials of odd degree. J. Global Optim. 25: 157–168

    Article  MathSciNet  MATH  Google Scholar 

  16. Maranas C.D. and Floudas C.A. (1995). Finding all solutions of nonlinearly constrained systems of equations. J. Global Optim. 7: 143–182

    Article  MathSciNet  MATH  Google Scholar 

  17. Meyer C.A. and Floudas C.A. (2003). Trilinear monomials with positive or negative domains: Facets of convex and concave envelopes. In: Floudas, C.A. and Pardalos, P.M. (eds) Frontiers in Global Optimization, pp 327–352. Kluwer, Santorini

    Google Scholar 

  18. Meyer C.A. and Floudas C.A. (2004). Convex hull of trilinear monomials with mixed-sign domains. J. Global Optim. 29: 125–155

    Article  MathSciNet  MATH  Google Scholar 

  19. Meyer C.A. and Floudas C.A. (2005). Convex envelopes for edge concave functions. Math. Program. Ser. B 103: 207–224

    Article  MathSciNet  MATH  Google Scholar 

  20. Pörn R., Harjunkoski I. and Westerlund T. (1999). Convexification of different classes of non-convex MINLP problems. Comput. Chem. Eng. 23: 439–448

    Article  Google Scholar 

  21. Ryoo H.S. and Sahinidis N.V. (2001). Analysis of bounds for multilinear functions. J. Global Optim. 19: 403–424

    Article  MathSciNet  MATH  Google Scholar 

  22. Sahinidis, N.V., Tawarmalani, M.: BARON 7.2.5: Global optimization of mixed-integer nonlinear programs, User’s manual (2005)

  23. Tardella F. (2003). On the existence of polyhedral convex envelopes. In: Floudas, C.A. and Pardalos, P.M. (eds) Frontiers in Global Optimization, pp 563–573. Kluwer, Santorini

    Google Scholar 

  24. Tawarmalani M., Ahmed S. and Sahinidis N.V. (2002). Product disaggregation in global optimization and relaxations of rational programs. J. Global Optim. 3: 281–302

    MathSciNet  MATH  Google Scholar 

  25. Tawarmalani M., Ahmed S. and Sahinidis N.V. (2002). Global optimization of 0–1 hyperbolic programs. J. Global Optim. 24: 385–416

    Article  MathSciNet  MATH  Google Scholar 

  26. Tawarmalani M. and Sahinidis N.V. (2001). Semidefinite relaxations of fractional programs via novel convexification techniques. J. Global Optim. 20: 137–158

    Article  MathSciNet  MATH  Google Scholar 

  27. Tawarmalani M. and Sahinidis N.V. (2002). Convex extensions and envelops of lower semi-continuous functions. Math. Program. 93: 247–263

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Information Management, National Chiao Tung University, No. 1001, Ta Hsueh Road, Hsinchu, 300, Taiwan

    Han-Lin Li

  2. Department of Business Management, National Taipei University of Technology, No. 1, Sec. 3, Chung-Hsiao E. Road, Taipei, 10608, Taiwan

    Jung-Fa Tsai

  3. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544, USA

    Christodoulos A. Floudas

Authors
  1. Han-Lin Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jung-Fa Tsai
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Christodoulos A. Floudas
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Han-Lin Li.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, HL., Tsai, JF. & Floudas, C.A. Convex underestimation for posynomial functions of positive variables. Optimization Letters 2, 333–340 (2008). https://doi.org/10.1007/s11590-007-0061-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-007-0061-6

Keywords

Search

Navigation