Charged ball method for solving some computational geometry problems

DOI10.3103/S1063454117030025MaRDI QIDQ2289102zbMATH OpenOpenAlexFDO

Authors Majid E. Abbasov

Publication date 28 January 2020

Published in Vestnik St. Petersburg University. Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3103/s1063454117030025

zbMATH Keywords

convex optimizationcomputational geometryminimal distancecharged ball method

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Stability of solutions to ordinary differential equations (34D20) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• scientific article; zbMATH DE number 165426
• Minimizing within Convex Bodies Using a Convex Hull Method
• Algorithms of projection of a point onto an ellipsoid
• A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\)
• scientific article; zbMATH DE number 1839735

Cites work

• scientific article; zbMATH DE number 4041131 (Why is no real title available?)
• scientific article; zbMATH DE number 757684 (Why is no real title available?)
• scientific article; zbMATH DE number 3315644 (Why is no real title available?)
• Finding the distance between ellipsoids
• On the Distance between Two Ellipsoids

Cited in

(4)

• The alternating direction method of multipliers for finding the distance between ellipsoids
• Comparison of methods computing the distance between two ellipsoids
• Projection of a Point onto a Convex Set via Charged Balls Method
• Randomized heuristic algorithms for orthogonal projection of a point onto a set

This page was built for publication: Charged ball method for solving some computational geometry problems

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