|
|
|
Publications in Math-Net.Ru |
Citations |
|
2024 |
| 1. |
A. B. Sviridenko, “The iterations’ number estimation for strongly polynomial linear programming algorithms”, Computer Research and Modeling, 16:2 (2024), 249–285  ; Computer Research and Modeling, 16:2 (2024), e249–e285 |
|
2019 |
| 2. |
A. B. Sviridenko, “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 |
1
|
|
2018 |
| 3. |
A. B. Sviridenko, “Direct multiplicative methods for sparse matrices. Quadratic programming”, Computer Research and Modeling, 10:4 (2018), 407–420 |
1
|
|
2017 |
| 4. |
A. B. Sviridenko, “Direct multiplicative methods for sparse matrices. Newton methods”, Computer Research and Modeling, 9:5 (2017), 679–703 |
3
|
| 5. |
A. B. Sviridenko, “Direct multiplicative methods for sparse matrices. Linear programming”, Computer Research and Modeling, 9:2 (2017), 143–165 |
4
|
|
2016 |
| 6. |
A. B. Sviridenko, “Direct multiplicative methods for sparse matrices. Unbalanced linear systems”, Computer Research and Modeling, 8:6 (2016), 833–860 |
4
|
| 7. |
A. B. Sviridenko, G. A. Zelenkov, “Correlation and realization of quasi-newton methods of absolute optimization”, Computer Research and Modeling, 8:1 (2016), 55–78 |
5
|
|
2015 |
| 8. |
A. B. Sviridenko, “The correction to Newton's methods of optimization”, Computer Research and Modeling, 7:4 (2015), 835–863 |
8
|
|
| Organisations |
|
| |
|
|
Contact us: