Convex programming: the minimum covering circle case

Huanbo Meng

doi:10.1117/12.2672704

28 March 2023 Convex programming: the minimum covering circle case

Huanbo Meng

Proceedings Volume 12597, Second International Conference on Statistics, Applied Mathematics, and Computing Science (CSAMCS 2022); 125970X (2023) https://doi.org/10.1117/12.2672704
Event: Second International Conference on Statistics, Applied Mathematics, and Computing Science (CSAMCS 2022), 2022, Nanjing, China

Abstract

In convex programming, the primal minimum covering circle case is associated with a complex nonlinear constraint. This article introduces the definition of a convex function and applies the Wolfe duality to derive the equivalent Wolfe dual problem with a single linear constraint. According to the duality theorem and the geometric characterization, the Wolfe dual problem is of equivalence basically to the primal problem with a unique feasible solution. Meanwhile, since the decision variable is optimal, the Wolfe dual problem satisfies the Karush-Kuhn-Tucker conditions in terms of Lagrange conditions. Subsequently, this article proposes a simplistic two-point covering circle case as a visualized approach to furthermore discuss the principle of convex programming in the graphic demonstration. Nevertheless, the article utilizes the Wolfe objective function and the constraint for the multi-point covering circle problem to implement the minimum covering circle and sphere across 50 randomly generated points, briefly discussing its applications.

Citation Download Citation

Huanbo Meng "Convex programming: the minimum covering circle case", Proc. SPIE 12597, Second International Conference on Statistics, Applied Mathematics, and Computing Science (CSAMCS 2022), 125970X (28 March 2023); https://doi.org/10.1117/12.2672704

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available