Geodesic
Distance between strongly and weakly convex sets
Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, Tome 21 (2021) no. 4, pp. 434-441.

Voir la notice de l'article provenant de la source Math-Net.Ru

The problem of finding the distance between non-intersecting strongly convex and weakly convex (as defined by J.-F. Viall) sets of finite-dimensional space is considered. Three alternative formalizations in the form of extremal problems are used in presenting the results. We obtained the necessary conditions for the solution of the problem taking into account the constants of strong and weak convexity of the sets and their other characteristics. Besides the condition of stationarity, they contain estimates of the growth of the objective functions in alternative formalizations of the problem as the argument moves away from the solution point. These growth estimates are further used to obtain both global and local solution conditions. In this case, the conditions of the local solution are accompanied by the indication of the radius of its neighborhood. The examples that show the importance of the conditions in the theorems being proved are given, as well as the accuracy of the formulas for the radii of the neighborhood of the local solution. 
@article{ISU_2021_21_4_a1,
     author = {S. I. Dudov and M. A. Osiptsev},
     title = {Distance between strongly and weakly convex sets},
     journal = {Izvestiya of Saratov University. Mathematics. Mechanics. Informatics},
     pages = {434--441},
     publisher = {mathdoc},
     volume = {21},
     number = {4},
     year = {2021},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ISU_2021_21_4_a1/}
}
TY  - JOUR
AU  - S. I. Dudov
AU  - M. A. Osiptsev
TI  - Distance between strongly and weakly convex sets
JO  - Izvestiya of Saratov University. Mathematics. Mechanics. Informatics
PY  - 2021
SP  - 434
EP  - 441
VL  - 21
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ISU_2021_21_4_a1/
LA  - ru
ID  - ISU_2021_21_4_a1
ER  - 
%0 Journal Article
%A S. I. Dudov
%A M. A. Osiptsev
%T Distance between strongly and weakly convex sets
%J Izvestiya of Saratov University. Mathematics. Mechanics. Informatics
%D 2021
%P 434-441
%V 21
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ISU_2021_21_4_a1/
%G ru
%F ISU_2021_21_4_a1
S. I. Dudov; M. A. Osiptsev. Distance between strongly and weakly convex sets. Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, Tome 21 (2021) no. 4, pp. 434-441. http://geodesic.mathdoc.fr/item/ISU_2021_21_4_a1/

[1] F. P. Vasiliev, Optimization Methods, MCCME, M., 2011, 624 pp. (in Russian)

[2] V. F. Dem'yanov, L. V. Vasil'ev, Nondifferentiable Optimization, Springer-Verlag, New York, 1985, 452 pp.

[3] J.-P. Vial, “Strong and weak convexity of set and funtions”, Mathematics of Operations Research, 8:2 (1983), 231–259

[4] E. S. Polovinkin, M. V. Balashov, Elements of Convex and Strongly Convex Analysis, Fizmatlit, M., 2007, 440 pp. (in Russian)

[5] G. E. Ivanov, Weakly Convex Sets and Functions, Fizmatlit, M., 2006, 352 pp. (in Russian)

[6] S. I. Dudov, M. A. Osiptsev, “Characterization of solutions of strong-weak convex programming problems”, Sbornik: Mathematics, 212:6 (2021), 782–809 | DOI | DOI