7 citations to https://www.mathnet.ru/eng/timm606
-
E. V. Prosolupov, G. Sh. Tamasyan, “Complexity estimation for an algorithm of searching for zero of a piecewise linear convex function”, J. Appl. Industr. Math., 12:2 (2018), 325–333
-
T. A. Angelov, “Predstavlenie kusochno-affinnykh funktsii v vide raznosti poliedralnykh”, Vestn. S.-Peterburg. un-ta. Ser. 10. Prikl. matem. Inform. Prots. upr., 2016, no. 1, 4–18
-
A. V. Fominykh, “Metod gipodifferentsialnogo spuska v zadache postroeniya programmnogo upravleniya”, Vestn. S.-Peterburg. un-ta. Ser. 10. Prikl. matem. Inform. Prots. upr., 2016, no. 1, 117–124
-
G. Sh. Tamasyan, E. V. Prosolupov, T. A. Angelov, “Comparative study of two fast algorithms for projecting a point to the standard simplex”, J. Appl. Industr. Math., 10:2 (2016), 288–301
-
V. F. Demyanov, M. V. Dolgopolik, “Kodifferentsiruemye funktsii v banakhovykh prostranstvakh: metody i prilozheniya k zadacham variatsionnogo ischisleniya”, Vestn. S.-Peterburg. un-ta. Ser. 10. Prikl. matem. Inform. Prots. upr., 2013, no. 3, 48–66
-
G. Sh. Tamasyan, “Gradientnye metody v variatsionnoi zadache so svobodnymi kontsami”, Vestn. S.-Peterburg. un-ta. Ser. 10. Prikl. matem. Inform. Prots. upr., 2012, no. 4, 77–84
-
Tamasyan G.Sh., “O metodakh naiskoreishego i gipodifferentsialnogo spuska v odnoi zadache variatsionnogo ischisleniya”, Vychislitelnye metody i programmirovanie: novye vychislitelnye tekhnologii, 13:1 (2012), 197–217
Methods of steepest and hypodifferential descent in one problem of calculus of variations