Geometric algorithms for finding a point in the intersection of balls

DOI10.1134/S0005117920050070OpenAlexW3021130528MaRDI QIDQ827997

Irina N. Lushchakova

Publication date: 14 January 2021

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0005117920050070

zbMATH Keywords

polynomial algorithmintersection of ballsdelivery applications of drones

Mathematics Subject Classification ID

Convex programming (90C25) Computational aspects related to convexity (52B55)

Cites Work

• On the convexity of a class of quadratic mappings and its application to the problem of finding the smallest ball enclosing a given intersection of balls
• Linear Matrix Inequalities in System and Control Theory
• Unnamed Item
• Unnamed Item

This page was built for publication: Geometric algorithms for finding a point in the intersection of balls