Abstract
This paper is dedicated to an optimization problem. Let A, B ⊂ R n be compact convex sets. Consider the minimal number t 0 > 0 such that t 0B covers A after a shift to a vector x 0 ∈ R n. The goal is to find t 0 and x 0 . In the special case of B being a unit ball centered at zero, x 0 and t 0 are known as the Chebyshev center and the Chebyshev radius of A. This paper focuses on the case in which A and B are defined with their black-box support functions. An algorithm for solving such problems efficiently is suggested. The algorithm has a superlinear convergence rate, and it can solve hundred-dimensional test problems in a reasonable time, but some additional conditions on A and B are required to guarantee the presence of convergence. Additionally, the behavior of the algorithm for a simple special case is investigated, which leads to a number of theoretical results. Perturbations of this special case are also studied.
Publisher
The Russian Academy of Sciences
Reference22 articles.
1. 1. Balashov, M.V., Covering a Set by a Convex Compactum: Error Estimates and Computation, Math. Notes, 2022, vol. 112, pp. 349-359. https://doi.org/10.1134/S0001434622090024
2. 2. Polyak, B.T., Vvedenie v optimizatsiyu (Introduction to Optimization), Moscow: Nauka, 1983.
3. 3. Tyrrell Rockafellar, R., Convex Analysis, Princeton University Press, 1997.
4. 4. Botkin, N. and Turova, V., An algorithm for finding the Chebyshev center of a convex polyhedron, Appl. Mat. Optim., 1995, vol. 29, pp. 211-222.
5. 5. Xia, Y. and Yang, M., Chebyshev center of the intersection of balls: complexity, relaxation and approximation, Mathematical Programming, 2021, vol. 187, pp. 287-315.