arXiv (All)
open access
A connectedness result for convex polynomial multi-objective optimization without boundedness
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
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On Pareto equilibria for bi-objective diffusive optimal control problems#1014445
- Learning Fair Pareto-Optimal Policies in Multi-Objective Reinforcement Learning#282786
- A bicriteria approach identifying nondominated portfolios#948410
- Trade-off invariance for weighted scalarizations in multi-objective optimization#1049886
- (MPO)$^2$: Multivariate Polynomial Optimization based on Matrix Product Operators#381752
Record · ID 1155964
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive