arXiv (All)
open access
Trade-off invariance for weighted scalarizations in multi-objective optimization
We consider weighted-sum scalarizations for an abstract multi-objective minimization problem defined by the vector-valued map $U\ni u\mapsto \big( f_1(u),\ldots, f_N(u)\big)$, where $U$ is an arbitrary nonempty set and no topology, convexity, compactness, or lower semicontinuity assumption is impose
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
- A connectedness result for convex polynomial multi-objective optimization without boundedness#1155964
- Tensor nuclear norm minimization with linear constraints#1117931
- Prioritized Multi-Objective Robot Control#657448
- The Sufficiency of Objective Representation#764508
- Large-Scale Portfolio Optimization Problem Under Cardinality Constraint With Enhanced Multi-Objective Evolutionary Algorithms#361491
Record · ID 1049886
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