|
|
Publications in Math-Net.Ru
-
The iterations’ number estimation for strongly polynomial linear programming algorithms
Computer Research and Modeling, 16:2 (2024), 249–285
-
Designing a zero on a linear manifold, a polyhedron, and a vertex of a polyhedron. Newton methods of minimization
Computer Research and Modeling, 11:4 (2019), 563–591
-
Direct multiplicative methods for sparse matrices. Quadratic programming
Computer Research and Modeling, 10:4 (2018), 407–420
-
Direct multiplicative methods for sparse matrices. Newton methods
Computer Research and Modeling, 9:5 (2017), 679–703
-
Direct multiplicative methods for sparse matrices. Linear programming
Computer Research and Modeling, 9:2 (2017), 143–165
-
Direct multiplicative methods for sparse matrices. Unbalanced linear systems
Computer Research and Modeling, 8:6 (2016), 833–860
-
Correlation and realization of quasi-newton methods of absolute optimization
Computer Research and Modeling, 8:1 (2016), 55–78
-
The correction to Newton's methods of optimization
Computer Research and Modeling, 7:4 (2015), 835–863
© , 2024