IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v340y2024i2d10.1007_s10479-024-05980-z.html
   My bibliography  Save this article

Projection methods for finding the greatest element of the intersection of max-closed convex sets

Author

Listed:
  • Tomáš Dlask

    (Faculty of Electrical Engineering, Czech Technical University in Prague)

Abstract

We focus on the problem of finding the greatest element of the intersection of max-closed convex sets. For this purpose, we analyze the famous method of cyclic projections and show that, if this method is suitably initialized and applied to max-closed convex sets, it converges to the greatest element of their intersection. Moreover, we propose another projection method, called the decreasing projection, which turns out both theoretically and practically preferable to Euclidean projections in this particular case. Next, we argue that several known algorithms, such as Bellman-Ford and Floyd-Warshall algorithms for shortest paths or Gauss-Seidel variant of value iteration in Markov decision processes, can be interpreted as special cases of iteratively applying decreasing projections onto certain max-closed convex sets. Finally, we link decreasing projections (and thus also the aforementioned algorithms) to bounds consistency in constraint programming.

Suggested Citation

  • Tomáš Dlask, 2024. "Projection methods for finding the greatest element of the intersection of max-closed convex sets," Annals of Operations Research, Springer, vol. 340(2), pages 811-836, September.
    • Handle: RePEc:spr:annopr:v:340:y:2024:i:2:d:10.1007_s10479-024-05980-z
    DOI: 10.1007/s10479-024-05980-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-024-05980-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-024-05980-z?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:annopr:v:340:y:2024:i:2:d:10.1007_s10479-024-05980-z. 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.