IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v91y2025i4d10.1007_s10898-024-01461-6.html
   My bibliography  Save this article

Approximations of unbounded convex projections and unbounded convex sets

Author

Listed:
  • Gabriela Kováčová

    (University of California, Los Angeles)

  • Birgit Rudloff

    (Vienna University of Economics and Business)

Abstract

We consider the problem of projecting a convex set onto a subspace or, equivalently formulated, the problem of computing a set obtained by applying a linear mapping to a convex feasible set. This includes the problem of approximating convex sets by polyhedrons. The existing literature on convex projections provides methods for bounded convex sets only, in this paper we propose a method that can handle both bounded and unbounded problems. The algorithms we propose build on the ideas of inner and outer approximation. In particular, we adapt the recently proposed methods for solving unbounded convex vector optimization problems to handle also the class of projection problems.

Suggested Citation

  • Gabriela Kováčová & Birgit Rudloff, 2025. "Approximations of unbounded convex projections and unbounded convex sets," Journal of Global Optimization, Springer, vol. 91(4), pages 787-805, April.
    • Handle: RePEc:spr:jglopt:v:91:y:2025:i:4:d:10.1007_s10898-024-01461-6
    DOI: 10.1007/s10898-024-01461-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-024-01461-6
    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/s10898-024-01461-6?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:jglopt:v:91:y:2025:i:4:d:10.1007_s10898-024-01461-6. 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.