Abstract
In this paper, the notion of a weakly convex set is introduced. Sharp estimates for the weak convexity constants of the sum and difference of such sets are given. It is proved that, in Hilbert space, the smoothness of a set is equivalent to the weak convexity of the set and its complement. Here, by definition, the smoothness of a set means that the field of unit outward normal vectors is defined on the boundary of the set; this vector field satisfies the Lipschitz condition. We obtain the minimax theorem for a class of problems with smooth Lebesgue sets of the goal function and strongly convex constraints. As an application of the results obtained, we prove the alternative theorem for program strategies in a linear differential quality game.
Similar content being viewed by others
References
E. S. Polovinkin and M. V. Balashov, Elements of Convex and Strongly Convex Analysis [in Russian] Fizmatlit, Moscow, 2004.
G. E. Ivanov and E. S. Polovinkin, “On strongly convex linear differential games,” Differentsial' nye Uravneniya [Differential Equations], 31 (1995), no. 10, 1641–1648.
G. E. Ivanov, “Continuity of optimal controls in differential games and some properties of weakly and strongly convex functions,” Mat. Zametki [Math. Notes], 66 (1999), no. 6, 816–839.
G. E. Ivanov, “Smoothness and convexity of marginal functions,” in: Some Problems of Fundamental and Applied Mathematics. A Collection of Scientific Works [in Russian], Moscow Institute of Physics and Technology, Moscow, 1999, pp. 79–92.
Author information
Authors and Affiliations
Additional information
__________
Translated from Matematicheskie Zametki, vol. 79, no. 1, 2006, pp. 60–86.
Original Russian Text Copyright © 2006 by G. E. Ivanov.
Rights and permissions
About this article
Cite this article
Ivanov, G.E. Weakly Convex Sets and Their Properties. Math Notes 79, 55–78 (2006). https://doi.org/10.1007/s11006-006-0005-y
Received:
Issue Date:
DOI: https://doi.org/10.1007/s11006-006-0005-y