Sufficient Conditions for the Linear Convergence of an Algorithm for Finding the Metric Projection of a Point onto a Convex Compact Set

Many problems, for example, problems on the properties of the attainability set of a linear control system, are reduced to finding the projection of zero onto some convex compact subset in a finite-dimensional Euclidean space. This set is given by its support function. In this paper, we discuss some minimum sufficient conditions that must be imposed on a convex compact set so that the gradient projection method for solving the problem of finding the projection of zero onto this set converges at a linear rate. An example is used to illustrate the importance of such conditions.