Metraipolis › archive › dc_1004fc282cc7
A connectedness result for convex polynomial multi-objective optimization without boundedness — arXiv:2610.01029
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.01029
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T16:00:38.119Z
- SHA-256 of the archived text
647a8d1bfb70cacb67dfd24997f5e523a47501c3210c478bbe99dfe714c5076b- Stable URL of this page
https://metraipolis.com/documento/dc_1004fc282cc7
How to cite
A connectedness result for convex polynomial multi-objective optimization without boundedness — arXiv:2610.01029 — arXiv (en), https://arxiv.org/abs/2610.01029 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_1004fc282cc7 (Metraipolis archive dc_1004fc282cc7, sha256 647a8d1bfb70cacb67dfd24997f5e523a47501c3210c478bbe99dfe714c5076b)
BibTeX
@misc{dc1004fc282cc7,
title = {A connectedness result for convex polynomial multi-objective optimization without boundedness — arXiv:2610.01029},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.01029},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_1004fc282cc7; sha256 647a8d1bfb70cacb67dfd24997f5e523a47501c3210c478bbe99dfe714c5076b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.01029. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We prove that the weak Pareto solution set of a multi-objective optimization problem with convex polynomial objectives and constraints is connected, assuming neither boundedness of the constraint set nor a constraint qualification. Since this set is semi-algebraic, its connectedness implies that it is path-connected whenever it is nonempty. In particular, convex quadratic multi-objective optimization problems have connected weak Pareto solution sets; this answers the weak Pareto part of an open question posed by N.~D.~Yen in \emph{Recent Developments in Vector Optimization} (Springer, 2012).
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-02 in math.OC).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2610.01029 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-06T15:14:57.953Z dalla pagina https://arxiv.org/catchup/math.OC/2026-10-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).