The distance between convex sets with Minkowski sum structure: application to collision detection
From MaRDI portal
Publication:2023661
DOI10.1007/s10589-020-00211-0zbMath1466.90102OpenAlexW3042509066MaRDI QIDQ2023661
Wenxing Zhang, Junping Zhang, Xiang-Feng Wang
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
distanceprojectioncollision detectionalternating direction method of multipliersprimal-dual hybrid gradient methodMinkowski sum of sets
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Smooth minimization of non-smooth functions
- Aggregation of Malmquist productivity indexes allowing for reallocation of resources
- Fast projection onto the simplex and the \(l_1\) ball
- An active index algorithm for the nearest point problem in a polyhedral cone
- CGAL Arrangements and their applications. A step-by-step guide
- How to project onto an isotone projection cone
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes
- Approximation of smooth convex bodies by random circumscribed polytopes
- A vertex algorithm for collision detection
- A first-order primal-dual algorithm for convex problems with applications to imaging
- 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
- The distance between two convex sets
- Approximation of convex sets by polytopes
- Proximal Splitting Methods in Signal Processing
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- Convergence Analysis of Primal-Dual Algorithms for a Saddle-Point Problem: From Contraction Perspective
- A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
- Probing the Pareto Frontier for Basis Pursuit Solutions
- Applications of the method of partial inverses to convex programming: Decomposition
- Decomposing a Polygon into Simpler Components
- Finding the nearest point in A polytope
- Finding the Point of a Polyhedron Closest to the Origin
- Stochastic Primal-Dual Hybrid Gradient Algorithm with Arbitrary Sampling and Imaging Applications
- On the Convergence of Primal-Dual Hybrid Gradient Algorithm
- On Alternating Direction Methods of Multipliers: A Historical Perspective
- Alternating Projections on Manifolds
- An Iterative Procedure for Computing the Minimum of a Quadratic Form on a Convex Set
- Convex analysis and monotone operator theory in Hilbert spaces
