Cite this article as:
Dudov S. I., Abramova V. V. On an Inner Estimate of a Convex Body by the Lebesgue Set of Convex Differentiable Function. Izv. Saratov Univ. (N. S.), Ser. Math. Mech. Inform., 2017, vol. 17, iss. 3, pp. 267-275. DOI: https://doi.org/10.18500/1816-9791-2017-17-3-267-275
On an Inner Estimate of a Convex Body by the Lebesgue Set of Convex Differentiable Function
A finite-dimentional problem of embedding the largest by the inclusion of lower Lebesgue set of given convex function f(x) in a given convex body D ⊂ R p is considered. This problem is the generalization of the problem of inscribed ball (function f(x) is some norm, and the Lebesgue sets are the corresponding balls). The function f(x) must be differentiable on R p possibly expending the point 0 p and 0 p is the uniqueness point of minimum. Mathematical formalization of this problem is proposed in the form of finding maximin of a function of the difference of arguments. It is proved that the objective function of this maximin problem is Lipschitzian on all space R p and quasiconcave on the set D. Also, superdifferentiability (in the sense of V.F.Demyanov–A.M.Rubinov) of objective function on the interior of Disestablishe dandthe corres ponding formula of superdifferential is derived. The necessary and sufficient solution conditions and the condition for uniqueness of solution are obtained on the basis of this formula of superdifferential.
1. Dudov S. I. Inner estimation of a convex set by a norm body. Comput. Math. Math. Phys., 1996, vol. 36, no. 5. pp. 683–688.
2. Dem’yanov V. F., Malozemov V. N. Introduction to minimax. New York, John Wiley & Sons, 1974. 307 p. (Russ. ed. : Moscow, Nauka, 1972. 368 p.)
3. Dem’yanov V. F. Minimaks : differentsiruemost’ po napravleniiam [Minimax: directional differentiability]. Leningrad, Leningrad Univ. Press, 1974. 112 p. (in Russian).
4. Fedorov V. V. Chislennye metody maksimina [Computational Methods of Maksimin]. Moscow, Nauka, 1979. 280 p. (in Russian).
5. Suharev A. G., Fedorov V. V. Minimax Problems and Minimax algorithms. Moscow, Moscow Univ. Press, 1979. 50 p. (in Russian).
6. Dudov S. I. Necessary and Sufficient Conditions for the Maximin of a Function of the Difference of Arguments. Comput. Math. Math. Phys., 1992, vol. 32, no. 12, pp. 1701–1714.
7. Dem’yanov V. F., Vasil’ev L. V. Non-differentiable optimization. New York, Springer-Verlag, 1985. 452 p. (Russ. ed. : Moscow, Nauka, 1981. 384 p.)
8. Dem’yanov V. F., Rubinov A. M. Osnovy negladkogo analiza i kvazidifferentsial’noe ischislenie [Foundation of Non-smooth Analysis and Quasidifferential Calculus]. Moscow, Nauka, 1990. 432 p. (in Russian).
9. Dudov S. I. Subdifferentiability and Superdifferentiability of Distance Function. Math. Notes, 1997, vol. 61, no. 4, pp. 440–450. DOI: https://doi.org/10.1007/BF02354988.
10. Clarke F. Optimization and Nonsmooth Analysis. New York, Wiley Interscience, 1983. 308 p. (Russ. ed. : Moscow, Nauka, 1988. 280 p.)
11. Polovinkin E. S. Mnogoznachnyi analiz i differentsial’nye vkliucheniia [Set-value Analysis and Differential Inclusion]. Moscow, Fizmatlin, 2014. 524 p. (in Russian).
12. Vasil’ev F. P. Metody optimizatsii, v 2 kn. Kn. 2. [Optimization Methods. Book 2]. Moscow, MCNMO, 2011. 434 p. (in Russian).
