Skip to main content
SpringerLink
Log in

Convex envelopes for edge-concave functions

  • Published:
Mathematical Programming Submit manuscript

Abstract.

Deterministic global optimization algorithms frequently rely on the convex underestimation of nonconvex functions. In this paper we describe the structure of the polyhedral convex envelopes of edge-concave functions over polyhedral domains using geometric arguments. An algorithm for computing the facets of the convex envelope over hyperrectangles in ℝ3 is described. Sufficient conditions are described under which the convex envelope of a sum of edge-concave functions may be shown to be equivalent to the sum of the convex envelopes of these functions.

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. Al-Khayyal, F.A., Falk, J.E.: Jointly constrained biconvex programming. Math. Oper. Res. 8 (2), 273–286 (1983)

    Article  MathSciNet  Google Scholar 

  2. Bertsekas, D.P., Nedić, A., Ozdaglar, A.E.: Convex Analysis and Optimization. Athena Scientific, Belmont, Massachusetts, 2003

  3. Björner, A., Las Vergnas, M., Sturmfels, B., White, N., Ziegler, G.M.: Oriented Matroids. Volume 46 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, 1993

  4. Cottle, R.W.: Minimal triangulations of the 4-cube. Discrete Math. 40, 25–29 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  5. Crama, Y.: Concave extensions for nonlinear 0-1 maximization problems. Math. Program. 61, 53–60 (1993)

    Article  MathSciNet  Google Scholar 

  6. Floudas, C.A.: Deterministic Global Optimization: Theory, Algorithms and Applications. Kluwer Academic Publishers, 2000

  7. Haiman, M.: A simple and relatively efficient triangulation of the n-cube. Discrete Comput. Geom. 6, 287–289 (1991)

    MATH  MathSciNet  Google Scholar 

  8. Horst, R., Tuy, H.: Global optimization: deterministic approaches. Springer-Verlag, Berlin, 1993. 2nd. rev. edition

  9. Hughes, R.B., Anderson, M.R.: Simplexity of the cube. Discrete Mathematics. 158, 99–150 (1999)

    Article  Google Scholar 

  10. Hughs, R.B.: Lower bounds on cube simplexity. Discrete Math. 133, 123–138 (1994)

    Article  MathSciNet  Google Scholar 

  11. Lee, C.W.: Triangulating the d-cube. In: J.W. Goodman (ed.), Discrete Geometry and Convexity. Volume 440 of Ann. N.Y. Acad. Sci., 1985, pp. 205–212

  12. Mara, P.S.: Triangulations for the cube. J. Comb. Theory Ser. A. 20, 170–176 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  13. McCormick, G.P.: Computability of global solutions to factorable nonconvex programs: Part I – convex underestimating problems. Math. Program. 10, 147–175 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  14. Meyer, C.A.: Convex Relaxations and Convex Envelopes for Deterministic Global Optimization. PhD thesis, Princeton University, Princeton, New Jersey, 2004

  15. Meyer, C.A., Floudas, C.A.: Convex envelopes of trilinear monomials with mixed sign domains. In: C.A. Floudas, P.M. Pardalos (eds.), Frontiers in Global Optimization, Dordrecht, 2003. Kluwer Academic Publishers, pp. 327–352

  16. Meyer, C.A., Floudas, C.A. Convex envelopes of trilinear monomials with positive or negative domains. J. Global Optim. 29, 125–155 (2004)

    Google Scholar 

  17. Rikun, A.D.: A convex envelope formula for multilinear functions. J. Global Optim. 10, 425–437 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  18. Sallee, J.F.: A triangulation of the n-cube. Discrete Math. 40, 81–86 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  19. Sherali, H.D.: Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets. Acta Mathematica Vietnamica 22, 245–270 (1997)

    MATH  MathSciNet  Google Scholar 

  20. Sherali, H.D., Adam, W. P.: A Reformulation-Linearization Technique for Solving Discrete and Continous Nonconvex Problems. Volume 31, Kluwer Academic Publishers, Dordrecht, 1999

  21. Sherali, H.D., Alameddine, A.: A new reformulation-linearization technique for bilinear programming problems. J. Global Optim. 2, 379–410 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  22. Smith, W.D.: A lower bound on the simplexity of the n-cube via hyperbolic volumes. Europ. J. Combinatorics 21, 131–137 (2000)

    Article  MATH  Google Scholar 

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

  24. Tawarmalani, M., Ahmed, S., Sahinidis, N.V.: Product disaggregation in global optimization and relaxations of rational programs. Optimization and Engineering 3, 281–303 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  25. Tawarmalani, M., Sahinidis, N.V.: Convex extensions and convex envelopes of lower semi-continuous functions. Math. Program. 2, 247–263 (2002)

    Article  MathSciNet  Google Scholar 

  26. Ziegler, G.M.: Lectures on Polytopes. Volume 152 of Graduate Texts in Mathematics. Springer Verlag, 1994

Download references

Author information

Authors and Affiliations

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

    Clifford A. Meyer & Christodoulos A. Floudas

Authors
  1. Clifford A. Meyer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christodoulos A. Floudas
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Christodoulos A. Floudas.

Additional information

Author to whom all correspondence should be addressed.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Meyer, C., Floudas, C. Convex envelopes for edge-concave functions. Math. Program. 103, 207–224 (2005). https://doi.org/10.1007/s10107-005-0580-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-005-0580-9

Keywords

Search

Navigation