Embedding of a homothete in a convex compactum: an algorithm and its convergence
- 1 January 2022
- journal article
- Published by Tambov State University - G.R. Derzhavin in Russian Universities Reports. Mathematics
Abstract
The problem of covering of a given convex compact set by a homothetic image of another convex compact set with a given homothety center is considered, the coefficient of homothety is calculated. The problem has an old history and is closely related to questions about the Chebyshev center, problems about translates, and other problems of computational geometry. Polyhedral approximation methods and other approximation methods do not work in a space of already moderate dimension (more than 5 on a PC). We propose an approach based on the application of the gradient projection method, which is much less sensitive to dimension than the approximation methods. We select classes of sets for which we can prove the linear convergence rate of the gradient method, i. e. convergence with the rate of a geometric progression with a positive ratio strictly less than 1. These sets must be strongly convex and have, in a certain sense, smoothness of the boundary.Keywords
Funding Information
- Russian Science Foundation (22-11-00042)
This publication has 6 references indexed in Scilit:
- Set Propagation Techniques for Reachability AnalysisAnnual Review of Control, Robotics, and Autonomous Systems, 2021
- Error bound conditions and convergence of optimization methods on smooth and proximally smooth manifoldsOptimization, 2020
- Strong and Weak Convexity of Closed Sets in a Hilbert SpaceSpringer Optimization and Its Applications, 2017
- Proximal alternating linearized minimization for nonconvex and nonsmooth problemsMathematical Programming, 2013
- Interior sphere property of attainable sets and time optimal control problemsESAIM: Control, Optimisation and Calculus of Variations, 2006
- $ M$-strongly convex subsets and their generating setsSbornik: Mathematics, 2000