Scholarlink

<p>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.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Approximations of unbounded convex projections and unbounded convex sets

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年1月13日

查看全文
  • Gabriela Kováčová,
  • Birgit Rudloff

摘要

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.