An upper bound on the Hausdorff distance between a Pareto set and its discretization in bi-objective convex quadratic optimization

DOI10.1007/s11590-022-01920-7OpenAlexW4297997406MaRDI QIDQ2678998

Publication date: 18 January 2023

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-022-01920-7

zbMATH Keywords

multi-objective optimization convex quadratic Pareto set approximation Pareto front approximation

Mathematics Subject Classification ID

Convex programming (90C25) Multi-objective and goal programming (90C29) Quadratic programming (90C20)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
On the quality of discrete representations in multiple objective programming
On the worst-case optimal multi-objective global optimization
On well-posedness and Hausdorff convergence of solution sets of vector optimization problems
On the convexity of a class of quadratic mappings and its application to the problem of finding the smallest ball enclosing a given intersection of balls
Convexity properties associated with nonconvex quadratic matrix functions and applications to quadratic programming
Nonlinear multiobjective optimization
Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
Multiobjective optimization involving quadratic functions
Solution methodologies for the smallest enclosing circle problem
Performance indicators in multiobjective optimization
\(\Phi\)-harmonic maps and \(\Phi\)-superstrongly unstable manifolds
Non-convex multi-objective optimization
How the (1+1) ES using isotropic mutations minimizes positive definite quadratic forms
Approximation methods in multiobjective programming
Differential Geometry of Curves and Surfaces
On Sampling Methods for Costly Multi-Objective Black-Box Optimization
Adaptive Scalarization Methods in Multiobjective Optimization
Global Stochastic Optimization with Low-Dispersion Point Sets
A Minimax Chebyshev Estimator for Bounded Error Estimation
A NOTE ON COMPUTING THE INTERSECTION OF SPHERES IN
Approximation Methods for Multiobjective Optimization Problems: A Survey
Regularization in Regression with Bounded Noise: A Chebyshev Center Approach

This page was built for publication: An upper bound on the Hausdorff distance between a Pareto set and its discretization in bi-objective convex quadratic optimization