Hausdorff distance between convex semialgebraic sets

DOI10.1007/S10898-023-01313-9MaRDI QIDQ6154398zbMATH OpenFDO

Authors Wenjie Zhao, Guangming Zhou

Publication date 15 February 2024

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10898-023-01313-9

zbMATH Keywords

expressions of Lagrange multipliersHausdorff distanceLasserre's hierarchypolynomial optimizationthe KKT conditions

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Recommendations

• The complexity of the Hausdorff distance
• The complexity of the Hausdorff distance
• Computational aspects of the Hausdorff distance in unbounded dimension
• Computation of the distance to semi-algebraic sets
• Computing the Hausdorff distance of two sets from their distance functions

Cites work

• A Lagrange multiplier expression method for bilevel polynomial optimization
• A linear time algorithm for the Hausdorff distance between convex polygons
• A new point matching algorithm for non-rigid registration
• A semidefinite approach for truncated \(K\)-moment problems
• Approximate matching of polygonal shapes
• Calculating the Hausdorff distance between curves
• Certifying convergence of Lasserre's hierarchy via flat truncation
• Computing the minimum Hausdorff distance between two point sets on a line under translation
• Detecting Global Optimality and Extracting Solutions in GloptiPoly
• Efficient visual recognition using the Hausdorff distance
• Further results on structural stability and robustness to bounded rationality
• Global optimization with polynomials and the problem of moments
• GloptiPoly 3: moments, optimization and semidefinite programming
• scientific article; zbMATH DE number 1726611 (Why is no real title available?)
• Minimax and applications
• Minimax theory and applications. Proceedings of the workshop, Erice, Italy, September 30--October 6, 1996
• Moments, positive polynomials and their applications
• On representations of the feasible set in convex optimization
• On structural stability and robustness to bounded rationality
• Precise Hausdorff distance computation between polygonal meshes
• Semidefinite programming for min-max problems and games
• Solving semidefinite-quadratic-linear programs using SDPT3
• Sums of squares, moment matrices and optimization over polynomials
• The Hausdorff distance between some sets of points
• The truncated moment problem via homogenization and flat extensions
• Tight relaxations for polynomial optimization and Lagrange multiplier expressions
• Truncated \(K\)-moment problems in several variables
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones

Cited in

(2)

• The complexity of the Hausdorff distance
• The complexity of the Hausdorff distance

This page was built for publication: Hausdorff distance between convex semialgebraic sets

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