Approximations of unbounded convex projections and unbounded convex sets
Gabriela Kováčová () and
Birgit Rudloff ()
Additional contact information
Gabriela Kováčová: University of California, Los Angeles
Birgit Rudloff: Vienna University of Economics and Business
Journal of Global Optimization, 2025, vol. 91, issue 4, No 4, 787-805
Abstract:
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.
Keywords: Unbounded convex sets; Convex projection; Inner and outer approximation (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1007/s10898-024-01461-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:jglopt:v:91:y:2025:i:4:d:10.1007_s10898-024-01461-6
Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898
DOI: 10.1007/s10898-024-01461-6
Access Statistics for this article
Journal of Global Optimization is currently edited by Sergiy Butenko
More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().