Advertisement

Journal of Global Optimization

, Volume 66, Issue 4, pp 629–668 | Cite as

Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes

  • Marco Locatelli
Article

Abstract

In this paper we show that the convex envelope over polytopes for a class of bivariate functions, including the bilinear and fractional functions as special cases, is characterized by a polyhedral subdivision of the polytopes, and is such that over each member of the subdivision the convex envelope has a given (although possibly only implicitly defined) functional form. For the bilinear and fractional case we show that there are three possible functional forms, which can be explicitly defined.

Keywords

Convex envelopes Polyhedral subdivisions Bilinear terms Fractional terms 

References

  1. 1.
    Al-Khayyal, F.A., Falk, J.E.: Jointly constrained biconvex programming. Math. Oper. Res. 8, 273–286 (1983)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Anstreicher, K.M., Burer, S.: Computable representations for convex hulls of low-dimensional quadratic forms. Math. Program. B 124, 33–43 (2010)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Anstreicher, K.M.: On convex relaxations for quadratically constrained quadratic programming. Math. Program. 136, 233–251 (2012)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Benson, H.P.: On the construction of convex and concave envelope formulas for bilinear and fractional functions on quadrilaterals. Comput. Opt. Appl. 27, 5–22 (2004)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Crama, Y.: Recognition problems for polynomials in 0–1 variables. Math. Program. 44, 139–155 (1989)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Kuno, T.: A branch-and-bound algorithm for maximizing the sum of several linear ratios. J. Global Optim. 22, 155–174 (2002)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Jach, M., Michaels, D., Weismantel, R.: The convex envelope of (\(n\)-1)-convex functions. SIAM J. Optim. 19(3), 1451–1466 (2008)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Laraki, R., Lasserre, J.B.: Computing uniform convex approximations for convex envelopes and convex hulls. J. Convex Anal. 15, 635–654 (2008)MathSciNetMATHGoogle Scholar
  9. 9.
    Linderoth, J.: A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs. Math. Program. 103, 251–282 (2005)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Locatelli, M., Schoen, F.: On convex envelopes for bivariate functions over polytopes. Math. Program. 144, 65–91 (2014)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Locatelli, M.: Alternative branching rules for some nonconvex problems. Opt. Methods Softw. 30, 365–378 (2015)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    Locatelli, M.: A technique to derive the analytical form of convex envelopes for some bivariate functions. J. Global Optim. 59, 477–501 (2014)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Locatelli, M.: Convex Envelopes of Bivariate Functions Through the Solution of KKT Systems. Available in Optimization-Online at http://www.optimization-online.org/DB_HTML/2016/01/5280.html
  14. 14.
    McCormick, G.P.: Computability of global solutions to factorable nonconvex programs—Part I—Convex underestimating problems. Math. Program. 10, 147–175 (1976)MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    Meyer, C.A., Floudas, C.A.: Convex envelopes for edge-concave functions. Math. Program. 103, 207–224 (2005)MathSciNetCrossRefMATHGoogle Scholar
  16. 16.
    Mitchell, J.E., Pang, J.-S., Yu, B.: Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs. Opt. Methods Softw. 29, 120–136 (2014)MathSciNetCrossRefMATHGoogle Scholar
  17. 17.
    Rikun, A.: A convex envelope formula for multilinear functions. J. Global Optim. 10, 425–437 (1997)MathSciNetCrossRefMATHGoogle Scholar
  18. 18.
    Sherali, H.D., Alameddine, A.: An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes. Ann. Oper. Res. 27, 197–210 (1992)MathSciNetMATHGoogle Scholar
  19. 19.
    Tawarmalani, M., Sahinidis, N.V.: Semidefinite relaxations of fractional programs via novel convexification techniques. J. Global Optim. 20, 137–158 (2001)MathSciNetCrossRefMATHGoogle Scholar
  20. 20.
    Tardella, F.: On the existence of polyhedral convex envelopes. In: Floudas, C.A., Pardalos, P.M. (eds.) Frontiers in Global Optimization, pp. 563–574. Kluwer, Dordrecht (2003)Google Scholar
  21. 21.
    Tardella, F.: Existence and sum decomposition of vertex polyhedral convex envelopes. Opt. Lett. 2, 363–375 (2008)MathSciNetCrossRefMATHGoogle Scholar
  22. 22.
    Tawarmalani, M., Richard, J.-P.P., Xiong, C.: Explicit convex and concave envelopes through polyhedral subdivisions. Math. Program. 138, 531–577 (2013)MathSciNetCrossRefMATHGoogle Scholar
  23. 23.
    Zamora, J.M., Grossmann, I.E.: A Branch and Contract algorithm for problems with concave univariate, bilinear and linear fractional terms. J. Global Optim. 14, 217–249 (1999)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  1. 1.Dipartimento di Ingegneria dell’InformazioneUniversità di ParmaParmaItaly

Personalised recommendations