An upper bound on the Hausdorff distance between a Pareto set and its discretization in bi-objective convex quadratic optimization. Ondes, B. E. & Hunter, S. R. Optimization Letters, 17:45–74, 2023. Expand abstract below for update.![An upper bound on the Hausdorff distance between a Pareto set and its discretization in bi-objective convex quadratic optimization [link]](https://bibbase.org/img/filetypes/link.svg "link")
Link ![An upper bound on the Hausdorff distance between a Pareto set and its discretization in bi-objective convex quadratic optimization [pdf]](https://bibbase.org/img/filetypes/pdf.svg "pdf")
Paper doi abstract bibtex 61 downloads We provide upper bounds on the Hausdorff distances between the efficient set and its discretization in the decision space, and between the Pareto set (also called the Pareto front) and its discretization in the objective space, in the context of bi-objective convex quadratic optimization on a compact feasible set. Our results imply that if $t$ is the dispersion of the sampled points in the discretized feasible set, then the Hausdorff distances in both the decision space and the objective space are $O(\sqrt{t})$ as $t$ decreases to zero. Update on May 31, 2023: There appears to be an error in the statement of Lemma 1. We think the respective upper bounds in the decision and objective spaces should be $t\sqrt{κ^*}$ and $h(t\sqrt{κ^*})$. The largest effect of this error would appear in Section 3 and, in particular, Lemma 3, where $t$ would be missing the multiplier of $\sqrt{κ^*}$ nearly everywhere. All results for $κ^*=1$ and the big-O results in the statement of the main theorem are unaffected.
@article{2023ondhun,
Year = {2023},
Author = {B. E. Ondes and S. R. Hunter},
Title = {An upper bound on the {Hausdorff} distance between a {Pareto} set and its discretization in bi-objective convex quadratic optimization},
journal = {Optimization Letters},
volume = {17},
pages = {45--74},
doi = {10.1007/s11590-022-01920-7},
url_Link = {https://rdcu.be/cWCJh},
url_Paper = {http://web.ics.purdue.edu/~hunter63/PAPERS/pre2022ondhun.pdf},
bibbase_note = {<span style="color: green">Expand abstract below for update.</span>},
abstract = {We provide upper bounds on the Hausdorff distances between the efficient set and its discretization in the decision space, and between the Pareto set (also called the Pareto front) and its discretization in the objective space, in the context of bi-objective convex quadratic optimization on a compact feasible set. Our results imply that if $t$ is the dispersion of the sampled points in the discretized feasible set, then the Hausdorff distances in both the decision space and the objective space are $O(\sqrt{t})$ as $t$ decreases to zero. Update on May 31, 2023: There appears to be an error in the statement of Lemma 1. We think the respective upper bounds in the decision and objective spaces should be $t\sqrt{\kappa^*}$ and $h(t\sqrt{\kappa^*})$. The largest effect of this error would appear in Section 3 and, in particular, Lemma 3, where $t$ would be missing the multiplier of $\sqrt{\kappa^*}$ nearly everywhere. All results for $\kappa^*=1$ and the big-O results in the statement of the main theorem are unaffected.},
keywords = {optimization > multi-objective > continuous}}
Downloads: 61
{"_id":"borxrk3M8t2Bwsa5u","bibbaseid":"ondes-hunter-anupperboundonthehausdorffdistancebetweenaparetosetanditsdiscretizationinbiobjectiveconvexquadraticoptimization-2023","author_short":["Ondes, B. E.","Hunter, S. R."],"bibdata":{"bibtype":"article","type":"article","year":"2023","author":[{"firstnames":["B.","E."],"propositions":[],"lastnames":["Ondes"],"suffixes":[]},{"firstnames":["S.","R."],"propositions":[],"lastnames":["Hunter"],"suffixes":[]}],"title":"An upper bound on the Hausdorff distance between a Pareto set and its discretization in bi-objective convex quadratic optimization","journal":"Optimization Letters","volume":"17","pages":"45–74","doi":"10.1007/s11590-022-01920-7","url_link":"https://rdcu.be/cWCJh","url_paper":"http://web.ics.purdue.edu/~hunter63/PAPERS/pre2022ondhun.pdf","bibbase_note":"<span style=\"color: green\">Expand abstract below for update.</span>","abstract":"We provide upper bounds on the Hausdorff distances between the efficient set and its discretization in the decision space, and between the Pareto set (also called the Pareto front) and its discretization in the objective space, in the context of bi-objective convex quadratic optimization on a compact feasible set. Our results imply that if $t$ is the dispersion of the sampled points in the discretized feasible set, then the Hausdorff distances in both the decision space and the objective space are $O(\\sqrt{t})$ as $t$ decreases to zero. Update on May 31, 2023: There appears to be an error in the statement of Lemma 1. We think the respective upper bounds in the decision and objective spaces should be $t\\sqrt{κ^*}$ and $h(t\\sqrt{κ^*})$. The largest effect of this error would appear in Section 3 and, in particular, Lemma 3, where $t$ would be missing the multiplier of $\\sqrt{κ^*}$ nearly everywhere. All results for $κ^*=1$ and the big-O results in the statement of the main theorem are unaffected.","keywords":"optimization > multi-objective > continuous","bibtex":"@article{2023ondhun,\n\tYear = {2023},\n\tAuthor = {B. E. Ondes and S. R. Hunter},\n\tTitle = {An upper bound on the {Hausdorff} distance between a {Pareto} set and its discretization in bi-objective convex quadratic optimization},\n\tjournal = {Optimization Letters},\n\tvolume = {17},\n\tpages = {45--74},\n\tdoi = {10.1007/s11590-022-01920-7},\n\turl_Link = {https://rdcu.be/cWCJh},\n\turl_Paper = {http://web.ics.purdue.edu/~hunter63/PAPERS/pre2022ondhun.pdf},\n\tbibbase_note = {<span style=\"color: green\">Expand abstract below for update.</span>},\n\tabstract = {We provide upper bounds on the Hausdorff distances between the efficient set and its discretization in the decision space, and between the Pareto set (also called the Pareto front) and its discretization in the objective space, in the context of bi-objective convex quadratic optimization on a compact feasible set. Our results imply that if $t$ is the dispersion of the sampled points in the discretized feasible set, then the Hausdorff distances in both the decision space and the objective space are $O(\\sqrt{t})$ as $t$ decreases to zero. Update on May 31, 2023: There appears to be an error in the statement of Lemma 1. We think the respective upper bounds in the decision and objective spaces should be $t\\sqrt{\\kappa^*}$ and $h(t\\sqrt{\\kappa^*})$. The largest effect of this error would appear in Section 3 and, in particular, Lemma 3, where $t$ would be missing the multiplier of $\\sqrt{\\kappa^*}$ nearly everywhere. All results for $\\kappa^*=1$ and the big-O results in the statement of the main theorem are unaffected.},\n\tkeywords = {optimization > multi-objective > continuous}}\n\n","author_short":["Ondes, B. E.","Hunter, S. R."],"key":"2023ondhun","id":"2023ondhun","bibbaseid":"ondes-hunter-anupperboundonthehausdorffdistancebetweenaparetosetanditsdiscretizationinbiobjectiveconvexquadraticoptimization-2023","role":"author","urls":{" link":"https://rdcu.be/cWCJh"," paper":"http://web.ics.purdue.edu/~hunter63/PAPERS/pre2022ondhun.pdf"},"keyword":["optimization > multi-objective > continuous"],"metadata":{"authorlinks":{}},"downloads":61},"bibtype":"article","biburl":"https://web.ics.purdue.edu/~hunter63/PAPERS/srhunterweb.bib","dataSources":["PkcXzWbdqPvM6bmCx","ZEwmdExPMCtzAbo22"],"keywords":["optimization > multi-objective > continuous"],"search_terms":["upper","bound","hausdorff","distance","between","pareto","set","discretization","objective","convex","quadratic","optimization","ondes","hunter"],"title":"An upper bound on the Hausdorff distance between a Pareto set and its discretization in bi-objective convex quadratic optimization","year":2023,"downloads":61}