Geodesic
Characterization of solutions of strong-weak convex programming problems
Sbornik. Mathematics, Tome 212 (2021) no. 6, pp. 782-809

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

Finite-dimensional problems of minimizing a strongly or weakly convex function on a strongly or weakly convex set are considered. Necessary and sufficient conditions for solutions of such problems are presented, which are based on estimates for the behaviour of the objective function on the feasible set taking account of the parameters of strong or weak convexity, as well as certain local features of the set and the function. The mathematical programming problem is considered separately for strongly and weakly convex functions. In addition, necessary conditions for a global and a local solution with differentiable objective function are found, in which a ‘strong’ stationarity condition is assumed to hold. Bibliography: 33 titles.
Keywords: strongly and weakly convex sets and functions, subdifferential, Lagrangian function, radius of local minimum, strong stationarity condition. 
@article{SM_2021_212_6_a1,
     author = {S. I. Dudov and M. A. Osiptsev},
     title = {Characterization of solutions of strong-weak convex programming problems},
     journal = {Sbornik. Mathematics},
     pages = {782--809},
     publisher = {mathdoc},
     volume = {212},
     number = {6},
     year = {2021},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/SM_2021_212_6_a1/}
}
TY  - JOUR
AU  - S. I. Dudov
AU  - M. A. Osiptsev
TI  - Characterization of solutions of strong-weak convex programming problems
JO  - Sbornik. Mathematics
PY  - 2021
SP  - 782
EP  - 809
VL  - 212
IS  - 6
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/SM_2021_212_6_a1/
LA  - en
ID  - SM_2021_212_6_a1
ER  - 
%0 Journal Article
%A S. I. Dudov
%A M. A. Osiptsev
%T Characterization of solutions of strong-weak convex programming problems
%J Sbornik. Mathematics
%D 2021
%P 782-809
%V 212
%N 6
%I mathdoc
%U http://geodesic.mathdoc.fr/item/SM_2021_212_6_a1/
%G en
%F SM_2021_212_6_a1
S. I. Dudov; M. A. Osiptsev. Characterization of solutions of strong-weak convex programming problems. Sbornik. Mathematics, Tome 212 (2021) no. 6, pp. 782-809. http://geodesic.mathdoc.fr/item/SM_2021_212_6_a1/