Tight bounds for the approximation ratio of the hypervolume indicator
From MaRDI portal
Recommendations
- Approximation quality of the hypervolume indicator
- The logarithmic hypervolume indicator
- Theory of the hypervolume indicator: optimal \(\mu\)-distributions and the choice of the reference point
- Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
- Population size matters: rigorous runtime results for maximizing the hypervolume indicator
Cited in
(13)- Performance indicators in multiobjective optimization
- An analysis of the hypervolume Sharpe-ratio indicator
- Computing representations using hypervolume scalarizations
- Optimal averaged Hausdorff archives for bi-objective problems: theoretical and numerical results
- Efficient optimization of many objectives by approximation-guided evolution
- Approximation quality of the hypervolume indicator
- Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
- On quality indicators for black-box level set approximation
- Theory of the hypervolume indicator: optimal \(\mu\)-distributions and the choice of the reference point
- The logarithmic hypervolume indicator
- Stochastic convergence of random search methods to fixed size Pareto front approximations
- Combining discrete and continuous information for multi-criteria optimization problems
- Convergence of set-based multi-objective optimization, indicators and deteriorative cycles
This page was built for publication: Tight bounds for the approximation ratio of the hypervolume indicator
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3163417)