Voir la notice de l'article provenant de la source Math-Net.Ru
@article{MZM_2021_109_4_a13, author = {M. V. Balashov}, title = {Growth {Conditions} on a {Function} and the {Error} {Bound} {Condition}}, journal = {Matemati\v{c}eskie zametki}, pages = {625--630}, publisher = {mathdoc}, volume = {109}, number = {4}, year = {2021}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/MZM_2021_109_4_a13/} }
M. V. Balashov. Growth Conditions on a Function and the Error Bound Condition. Matematičeskie zametki, Tome 109 (2021) no. 4, pp. 625-630. http://geodesic.mathdoc.fr/item/MZM_2021_109_4_a13/
[1] H. Karimi, J. Nutini, M. Schmidt, Machine Learning and Knowledge Discovery in Databases, Lecture Notes in Comput. Sci., 9851, Springer, Cham, 2016, 795–811 | DOI
[2] M. V. Balashov, Matem. zametki, 108:5 (2020), 657–668 | DOI | Zbl
[3] M. V. Balashov, A. A. Tremba, “Error bound conditions and convergence ofoptimization methods on smooth and proximallysmooth manifolds”, Optimization, 2020 | DOI
[4] M. V. Balashov, B. T. Polyak, A. A. Tremba, Numer. Funct. Anal. Optim., 41:7 (2020), 822–849 | DOI | MR | Zbl
[5] J.-P. Vial, Math. Oper. Res., 8:2 (1983), 231–259 | DOI | MR | Zbl
[6] F. H. Clarke, R. J. Stern, P. R. Wolenski, J. Convex Anal., 2:1-2 (1995), 117–144 | MR | Zbl
[7] M. V. Balashov, Matem. sb., 211:4 (2020), 3–26 | DOI | Zbl
[8] M. V. Balashov, “The gradient projection algorithm for smooth sets and functions in nonconvex case”, Set-Valued Var. Anal., 2020 | DOI
[9] R. Schneider, A. Uschmajew, SIAM J. Optim., 25:1 (2015), 622–646 | DOI | MR | Zbl
[10] D. Drusvyatskiy, A. S. Lewis, Math. Oper Res., 43:3 (2018), 919–948 | DOI | MR | Zbl