IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v60y2015i1p231-261.html
   My bibliography  Save this article

A linear-time approximate convex envelope algorithm using the double Legendre–Fenchel transform with application to phase separation

Author

Listed:
  • Lorenzo Contento
  • Alexandre Ern
  • Rossana Vermiglio

Abstract

We study the double discrete Legendre–Fenchel transform (LFT) to approximate the convex envelope of a given function. We analyze the convergence of the double discrete LFT in the multivariate case based on previous convergence results for the discrete LFT. We focus our attention on the grid on which the second discrete LFT is computed (dual grid); its choice has great impact on the accuracy of the resulting approximation of the convex envelope. Then, we present an improvement (both in time and accuracy) to the standard algorithm based on a change in the factorization order for the second discrete LFT. This modification is particularly beneficial for bivariate functions. Moreover, we introduce a method for handling functions that are unbounded outside sets of general shape. We also present some situations in which the selection of the dual grid is crucial, and show that it is possible to choose a dual grid of arbitrary size without increasing the memory requirements of the algorithm. Finally, we apply our algorithm to the study of phase separation in non-ideal ionic solutions. Copyright Springer Science+Business Media New York 2015

Suggested Citation

  • Lorenzo Contento & Alexandre Ern & Rossana Vermiglio, 2015. "A linear-time approximate convex envelope algorithm using the double Legendre–Fenchel transform with application to phase separation," Computational Optimization and Applications, Springer, vol. 60(1), pages 231-261, January.
  • Handle: RePEc:spr:coopap:v:60:y:2015:i:1:p:231-261
    DOI: 10.1007/s10589-014-9666-8
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10589-014-9666-8
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s10589-014-9666-8?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:coopap:v:60:y:2015:i:1:p:231-261. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.