The distance between convex sets with Minkowski sum structure: application to collision detection
type: Item
instance of: scholarly article
title: The distance between convex sets with Minkowski sum structure: application to collision detection
zbMATH Open document ID: 1466.90102
author: Junping Zhang
author: Wenxing Zhang
author: Xiangfeng Wang
published in: Computational Optimization and Applications
publication date: 2021-05-03T00:00:00Z
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 7342387
zbMATH Keywords: distance
zbMATH Keywords: Minkowski sum of sets
zbMATH Keywords: projection
zbMATH Keywords: alternating direction method of multipliers
zbMATH Keywords: primal-dual hybrid gradient method
zbMATH Keywords: collision detection
describes a project that uses: CGAL
describes a project that uses: UNLocBoX
describes a project that uses: SPGL1
MaRDI profile type: Publication
full work available at URL: s10589-020-00211-0
OpenAlex ID: W3042509066
cites work: A vertex algorithm for collision detection
cites work: Convex analysis and monotone operator theory in Hilbert spaces
cites work: Q4830373
cites work: Q4001523
cites work: Approximation of smooth convex bodies by random circumscribed polytopes
cites work: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
cites work: Approximation of convex sets by polytopes
cites work: A first-order primal-dual algorithm for convex problems with applications to imaging
cites work: Stochastic Primal-Dual Hybrid Gradient Algorithm with Arbitrary Sampling and Imaging Applications
cites work: Proximal Splitting Methods in Signal Processing
cites work: Fast projection onto the simplex and the \(l_1\) ball
cites work: The distance between two convex sets
cites work: A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
cites work: CGAL Arrangements and their applications. A step-by-step guide
cites work: A dual algorithm for the solution of nonlinear variational problems via finite element approximation
cites work: An Iterative Procedure for Computing the Minimum of a Quadratic Form on a Convex Set
cites work: On Alternating Direction Methods of Multipliers: A Historical Perspective
cites work: Q4144736
cites work: Convergence analysis of primal-dual algorithms for a saddle-point problem: from contraction perspective
cites work: On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
cites work: On the Convergence of Primal-Dual Hybrid Gradient Algorithm
cites work: Decomposing a Polygon into Simpler Components
cites work: Alternating Projections on Manifolds
cites work: An active index algorithm for the nearest point problem in a polyhedral cone
cites work: Aggregation of Malmquist productivity indexes allowing for reallocation of resources
cites work: Finding the Point of a Polyhedron Closest to the Origin
cites work: How to project onto an isotone projection cone
cites work: Smooth minimization of non-smooth functions
cites work: On the equivalence of the primal-dual hybrid gradient method and Douglas-Rachford splitting
cites work: Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets
cites work: A primer on monotone operator methods
cites work: A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes
cites work: Applications of the method of partial inverses to convex programming: Decomposition
cites work: Probing the Pareto Frontier for Basis Pursuit Solutions
cites work: Finding the nearest point in A polytope
DOI: 10.1007/S10589-020-00211-0
Recommended article: Q5009560
Recommended article: The Minkowskij distance between two disjoint convex polyhedral sets
Recommended article: Minimization of the Hausdorff distance between convex polyhedrons
Recommended article: Distances to convex sets
Recommended article: Distance sets corresponding to convex bodies
Recommended article: An optimal algorithm for solving collision distance between convex polygons in plane
Recommended article: Convex sets in minimum-distance estimation
Recommended article: A Simple Method for Computing Minkowski Sum Boundary in 3D Using Collision Detection
Recommended article: Iterative algorithms for minimizing the Hausdorff distance between convex polyhedrons
Recommended article: Q4662253
description: scientific article; zbMATH DE number 7342387