Results 11 to 20 of about 31,789 (298)
On the invariance of the Pareto optimal set [PDF]
In the previous paper presented at the 11th SOR, Darmstadt 1986, the authors had shown that the Pareto optimal set of a multicriteria problem remains invariable if on the objective vector function operates a strictly monotone operator of strictly ...
Vincentiu Dumitru, Florica Luban
doaj +2 more sources
Approximating the Pareto set [PDF]
This paper adresses the problem of diversity in multiobjective evolutionary algorithms and its implications for the quality of the approximated set of efficient solutions (Pareto set).
Rudolph, Günther +2 more
core +3 more sources
Efficient Identification of the Pareto Optimal Set [PDF]
. In this paper, we focus on expensive multiobjective optimization problems and propose a method to predict an approximation of the Pareto optimal set using classification of sampled decision vectors as dominated or nondominated.
Rob J. Hyndman +2 more
core +3 more sources
Adaptive Algorithms for Relaxed Pareto Set Identification [PDF]
International audienceIn this paper we revisit the fixed-confidence identification of the Pareto optimal set in a multi-objective multi-armed bandit model. As the sample complexity to identify the exact Pareto set can be very large, a relaxation allowing
Richert, Laura +2 more
core +7 more sources
Pareto Navigation Gradient Descent: a First-Order Algorithm for Optimization in Pareto Set
Many modern machine learning applications, such as multi-task learning, require finding optimal model parameters to trade-off multiple objective functions that may conflict with each other.
Ye, Mao, Liu, Qiang
core +3 more sources
In bi-criteria optimization problems, the goal is typically to compute the set of Pareto-optimal solutions. Many algorithms for these types of problems rely on efficient merging or combining of partial solutions and filtering of dominated solutions in the resulting sets.
Demian Hespe +3 more
openaire +4 more sources
One-exact approximate Pareto sets [PDF]
AbstractPapadimitriou and Yannakakis (Proceedings of the 41st annual IEEE symposium on the Foundations of Computer Science (FOCS), pp 86–92, 2000) show that the polynomial-time solvability of a certain auxiliary problem determines the class of multiobjective optimization problems that admit a polynomial-time computable $$(1+\varepsilon , \dots , 1 ...
Arne Herzel +4 more
openaire +4 more sources
Beliefs and Pareto Efficient Sets: A Remark [PDF]
We show that, in a two-period economy with uncertainty in the second period, if an allocation is Pareto optimal for a given set of beliefs and remains optimal when these beliefs are changed, then the set of optimal allocations of the two economies must actually coincide.
Gajdos Preuss, Thibault +1 more
openaire +4 more sources
On the Construction of Pareto-Compliant Combined Indicators [PDF]
The most relevant property that a quality indicator (QI) is expected to have is Pareto compliance, which means that every time an approximation set strictly dominates another in a Pareto sense, the indicator must reflect this.
Coello, C.A. +2 more
core +1 more source
Pareto-optimized solution set under essential maintenance strategy at 1-inspection maintenance.
Pareto-optimized solution set under essential maintenance strategy at 1-inspection maintenance.
Chengjie Rao (16884149) +4 more
core +1 more source

