Approximation quality of the hypervolume indicator

DOI10.1016/J.ARTINT.2012.09.005MaRDI QIDQ360122zbMATHOpenAlexFDO

Authors Karl Bringmann, Tobias Friedrich

Publication date 26 August 2013

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL http://www.sciencedirect.com/science/article/pii/S0004370212001178

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Multi-objective and goal programming (90C29) Approximation algorithms (68W25)

Recommendations

• Tight bounds for the approximation ratio of the hypervolume indicator
• Volume as a measure of approximation for the Jacobi-Perron algorithm
• Theory of the hypervolume indicator: optimal \(\mu\)-distributions and the choice of the reference point
• Rough approximation quality revisited
• Approximation and convergence of the intrinsic volume
• A box decomposition algorithm to compute the hypervolume indicator
• On the sample-mean method for computing hyper-volumes

Cited in

(20)

• Speeding up many-objective optimization by Monte Carlo approximations
• A weighted-sum method for solving the bi-objective traveling thief problem
• Theory of the hypervolume indicator: optimal \(\mu\)-distributions and the choice of the reference point
• Optimal averaged Hausdorff archives for bi-objective problems: theoretical and numerical results
• On quality indicators for black-box level set approximation
• An approach for bi-objective maintenance scheduling on a networked system with limited resources
• Hypervolume maximization via set based Newton's method
• Tight bounds for the approximation ratio of the hypervolume indicator
• Performance indicators in multiobjective optimization
• Approximate non-dominated sorting for evolutionary many-objective optimization
• Faster hypervolume-based search using Monte Carlo sampling
• Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
• The logarithmic hypervolume indicator
• Bi-goal evolution for many-objective optimization problems
• An analysis of the hypervolume Sharpe-ratio indicator
• A box decomposition algorithm to compute the hypervolume indicator
• Computing representations using hypervolume scalarizations
• A multi-objective clustering approach based on different clustering measures combinations
• Population size matters: rigorous runtime results for maximizing the hypervolume indicator
• Fast hypervolume approximation scheme based on a segmentation strategy

This page was built for publication: Approximation quality of the hypervolume indicator

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q360122)