On Some Problems with Multivalued Mappings

Abstract

We consider some problems with a set-valued mapping, which can be reduced to minimization of a homogeneous Lipschitz function on the unit sphere. Latter problem can be solved in some cases with a first order algorithm—the gradient projection method. As one of the examples, the case when set-valued mapping is the reachable set of a linear autonomous controlled system is considered. In several settings, the linear convergence is proven. The methods used in proofs follow those introduced by B.T. Polyak for the case where Lezanski–Polyak–Lojasiewicz condition holds. Unlike algorithms that use approximation of the reachable set, the proposed algorithms depend far less on dimension and other parameters of the problem. Efficient error estimation is possible. Numerical experiments confirm the effectiveness of the considered approach. This approach can also be applied to various set-theoretical problems with general set-valued mappings.