The distance between convex sets with Minkowski sum structure: application to collision detection
DOI10.1007/S10589-020-00211-0zbMATH Open1466.90102OpenAlexW3042509066MaRDI QIDQ2023661FDOQ2023661
Xiangfeng Wang, Wenxing Zhang, Junping Zhang
Publication date: 3 May 2021
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-020-00211-0
alternating direction method of multipliersdistanceprojectioncollision detectionprimal-dual hybrid gradient methodMinkowski sum of sets
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- CGAL Arrangements and their applications. A step-by-step guide
- Probing the Pareto Frontier for Basis Pursuit Solutions
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Convex analysis and monotone operator theory in Hilbert spaces
- Smooth minimization of non-smooth functions
- On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
- Proximal Splitting Methods in Signal Processing
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
- Convergence analysis of primal-dual algorithms for a saddle-point problem: from contraction perspective
- On the Convergence of Primal-Dual Hybrid Gradient Algorithm
- On Alternating Direction Methods of Multipliers: A Historical Perspective
- Finding the nearest point in A polytope
- Finding the Point of a Polyhedron Closest to the Origin
- Alternating Projections on Manifolds
- An Iterative Procedure for Computing the Minimum of a Quadratic Form on a Convex Set
- An active index algorithm for the nearest point problem in a polyhedral cone
- Aggregation of Malmquist productivity indexes allowing for reallocation of resources
- Fast projection onto the simplex and the \(l_1\) ball
- Applications of the method of partial inverses to convex programming: Decomposition
- Approximation of convex sets by polytopes
- How to project onto an isotone projection cone
- The distance between two convex sets
- Approximation of smooth convex bodies by random circumscribed polytopes
- Decomposing a Polygon into Simpler Components
- A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes
- Stochastic Primal-Dual Hybrid Gradient Algorithm with Arbitrary Sampling and Imaging Applications
- A vertex algorithm for collision detection
- A primer on monotone operator methods
- Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets
- On the equivalence of the primal-dual hybrid gradient method and Douglas-Rachford splitting
Cited In (3)
Uses Software
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Minimization of the Hausdorff distance between convex polyhedrons 👍 👎
- Distance sets corresponding to convex bodies 👍 👎
- Distances to convex sets 👍 👎
- Convex sets in minimum-distance estimation 👍 👎
- An optimal algorithm for solving collision distance between convex polygons in plane 👍 👎
- Iterative algorithms for minimizing the Hausdorff distance between convex polyhedrons 👍 👎
- A Simple Method for Computing Minkowski Sum Boundary in 3D Using Collision Detection 👍 👎
- The Minkowskij distance between two disjoint convex polyhedral sets 👍 👎
This page was built for publication: The distance between convex sets with Minkowski sum structure: application to collision detection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2023661)
