Hausdorff distance between convex semialgebraic sets

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Solving semidefinite-quadratic-linear programs using SDPT3
Calculating the Hausdorff distance between curves
Further results on structural stability and robustness to bounded rationality
The truncated moment problem via homogenization and flat extensions
A linear time algorithm for the Hausdorff distance between convex polygons
Precise Hausdorff distance computation between polygonal meshes
Semidefinite programming for min-max problems and games
On representations of the feasible set in convex optimization
Computing the minimum Hausdorff distance between two point sets on a line under translation
Minimax theory and applications. Proceedings of the workshop, Erice, Italy, September 30--October 6, 1996
Minimax and applications
Approximate matching of polygonal shapes
A semidefinite approach for truncated \(K\)-moment problems
Tight relaxations for polynomial optimization and Lagrange multiplier expressions
Certifying convergence of Lasserre's hierarchy via flat truncation
On structural stability and robustness to bounded rationality
Efficient visual recognition using the Hausdorff distance
Global Optimization with Polynomials and the Problem of Moments
GloptiPoly 3: moments, optimization and semidefinite programming
A new point matching algorithm for non-rigid registration
Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Detecting Global Optimality and Extracting Solutions in GloptiPoly
A Lagrange Multiplier Expression Method for Bilevel Polynomial Optimization

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