Methods of steepest and hypodifferential descent in one problem of calculus of variations
G. Sh. Tamasyan

This publication is cited in the following articles:

1. 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        
2. 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    
3. 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          
4. G. Sh. Tamasyan, A. A. Chumakov, “Finding the distance between the ellipsoids”, J. Appl. Industr. Math., 8:3 (2014), 400–410