EUVIMEDEUVIMED entdecken
Crossref

Algorithms to Solve Unbounded Convex Vector Optimization Problems

Andrea Wagner, Firdevs Ulus, Birgit Rudloff, Gabriela Kováčová, Niklas Hey

SIAM Journal on Optimization · 31.12.2023 · 33 (4) · 2598-2624

DOI: 10.1137/22m1507693 ↗

Kurz gefasst

Fachartikel in der Zeitschrift SIAM Journal on Optimization, online erschienen am 12.10.2023. Verfasst von Andrea Wagner und 4 weiteren Autor:innen. Die Arbeit wurde bisher 8-mal zitiert (Crossref) und nennt 30 Literaturangaben. Gefördert von: Oesterreichische Nationalbank.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

This paper is concerned with solution algorithms for general convex vector optimization problems (CVOPs). So far, solution concepts and approximation algorithms for solving CVOPs exist only for bounded problems [Ç. Ararat, F. Ulus, and M. Umer, J. Optim. Theory Appl., 194 (2022), pp. 681–712], [D. Dörfler, A. Löhne, C. Schneider, and B. Weißing, Optim. Methods Softw., 37 (2022), pp. 1006–1026], [A. Löhne, B. Rudloff, and F. Ulus, J. Global Optim., 60 (2014), pp. 713–736]. They provide a polyhedral inner and outer approximation of the upper image that have a Hausdorff distance of at most [Formula: see text]. However, it is well known (see [F. Ulus, J. Global Optim., 72 (2018), pp. 731–742]), that for some unbounded problems such polyhedral approximations do not exist. In this paper, we will propose a generalized solution concept, called an [Formula: see text]–solution, that allows one to also consider unbounded CVOPs. It is based on additionally bounding the recession cones of the inner and outer polyhedral approximations of the upper image in a meaningful way. An algorithm is proposed that computes such [Formula: see text]–outer and [Formula: see text]–inner approximations of the recession cone of the upper image. In combination with the results of [A. Löhne, B. Rudloff, and F. Ulus, J. Global Optim., 60 (2014), pp. 713–736] this provides a primal and a dual algorithm that allow one to compute [Formula: see text]–solutions of (potentially unbounded) CVOPs. Numerical examples are provided.

Förderung

  • Oesterreichische Nationalbank

Zitieren

APA

Wagner, A., Ulus, F., Rudloff, B., Kováčová, G., & Hey, N. (2023). Algorithms to Solve Unbounded Convex Vector Optimization Problems. SIAM Journal on Optimization, 33(4), 2598-2624. https://doi.org/10.1137/22m1507693

Vancouver

Wagner A, Ulus F, Rudloff B, Kováčová G, Hey N. Algorithms to Solve Unbounded Convex Vector Optimization Problems. SIAM Journal on Optimization. 2023;33(4):2598-2624. doi:10.1137/22m1507693

BibTeX
@article{Wagner2023,
  author = {Wagner, Andrea and Ulus, Firdevs and Rudloff, Birgit and Kováčová, Gabriela and Hey, Niklas},
  title = {Algorithms to Solve Unbounded Convex Vector Optimization Problems},
  journal = {SIAM Journal on Optimization},
  year = {2023},
  volume = {33},
  number = {4},
  pages = {2598--2624},
  doi = {10.1137/22m1507693}
}
Kostenlos starten →