IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-00243009.html
   My bibliography  Save this paper

Computing uniform convex approximations for convex envelopes and convex hulls

Author

Listed:
  • Rida Laraki

    (CECO - Laboratoire d'économétrie de l'École polytechnique - X - École polytechnique - CNRS - Centre National de la Recherche Scientifique)

  • Jean-Bernard Lasserre

    (LAAS-MAC - Équipe Méthodes et Algorithmes en Commande - LAAS - Laboratoire d'analyse et d'architecture des systèmes - UT Capitole - Université Toulouse Capitole - UT - Université de Toulouse - INSA Toulouse - Institut National des Sciences Appliquées - Toulouse - INSA - Institut National des Sciences Appliquées - UT - Université de Toulouse - UT2J - Université Toulouse - Jean Jaurès - UT - Université de Toulouse - UT3 - Université Toulouse III - Paul Sabatier - UT - Université de Toulouse - CNRS - Centre National de la Recherche Scientifique - Toulouse INP - Institut National Polytechnique (Toulouse) - UT - Université de Toulouse)

Abstract

We provide a numerical procedure to compute uniform (convex) approximations {f_{r}} of the convex envelope f of a rational fraction f, on a compact semi-algebraic set D. At each point x in K=co(D), computing f_{r}(x) reduces to solving a semidefinite program. We next characterize the convex hull K=co(D) in terms of the projection of a semi-infinite LMI, and provide outer convex approximations {K_{r}}?K. Testing whether x is not in K reduces to solving finitely many semidefinite programs.

Suggested Citation

  • Rida Laraki & Jean-Bernard Lasserre, 2008. "Computing uniform convex approximations for convex envelopes and convex hulls," Post-Print hal-00243009, HAL.
    • Handle: RePEc:hal:journl:hal-00243009
    Note: View the original document on HAL open archive server: https://hal.science/hal-00243009
    as

    Download full text from publisher

    File URL: https://hal.science/hal-00243009/document
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Rida Laraki & William D. Sudderth, 2004. "The Preservation of Continuity and Lipschitz Continuity by Optimal Reward Operators," Mathematics of Operations Research, INFORMS, vol. 29(3), pages 672-685, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Marco Locatelli, 2020. "Convex envelope of bivariate cubic functions over rectangular regions," Journal of Global Optimization, Springer, vol. 76(1), pages 1-24, January.
    2. M. Locatelli, 2022. "Exact and approximate results for convex envelopes of special structured functions over simplices," Journal of Global Optimization, Springer, vol. 83(2), pages 201-220, June.
    3. Marco Locatelli, 2018. "Convex envelopes of bivariate functions through the solution of KKT systems," Journal of Global Optimization, Springer, vol. 72(2), pages 277-303, October.
    4. Rida Laraki & Jérôme Renault, 2020. "Acyclic Gambling Games," Mathematics of Operations Research, INFORMS, vol. 45(4), pages 1237-1257, November.
    5. Marco Locatelli, 2016. "Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes," Journal of Global Optimization, Springer, vol. 66(4), pages 629-668, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Laraki, Rida & Sorin, Sylvain, 2015. "Advances in Zero-Sum Dynamic Games," Handbook of Game Theory with Economic Applications,, Elsevier.
    2. Laraki, Rida & Renault, Jérôme, 2017. "Acyclic Gambling Games," TSE Working Papers 17-768, Toulouse School of Economics (TSE).
    3. Olivier Morand & Kevin Reffett & Suchismita Tarafdar, 2018. "Generalized Envelope Theorems: Applications to Dynamic Programming," Journal of Optimization Theory and Applications, Springer, vol. 176(3), pages 650-687, March.
    4. Rida Laraki & Jérôme Renault, 2020. "Acyclic Gambling Games," Mathematics of Operations Research, INFORMS, vol. 45(4), pages 1237-1257, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hal:journl:hal-00243009. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.