All issues
- 2024 Vol. 16
- 2023 Vol. 15
- 2022 Vol. 14
- 2021 Vol. 13
- 2020 Vol. 12
- 2019 Vol. 11
- 2018 Vol. 10
- 2017 Vol. 9
- 2016 Vol. 8
- 2015 Vol. 7
- 2014 Vol. 6
- 2013 Vol. 5
- 2012 Vol. 4
- 2011 Vol. 3
- 2010 Vol. 2
- 2009 Vol. 1
The correction to Newton's methods of optimization
An approach to the decrease of norm of the correction in Newton’s methods of optimization, based on the Cholesky’s factorization is presented, which is based on the integration with the technique of the choice of leading element of algorithm of linear programming as a method of solving the system of equations. We investigate the issues of increasing of the numerical stability of the Cholesky’s decomposition and the Gauss’ method of exception.
- Direct multiplicative methods for sparse matrices. Quadratic programming. // Computer Research and Modeling. — 2018. — V. 10, no. 4. — P. 407. DOI: 10.20537/2076-7633-2018-10-4-407-420 .
- Correlation and realization of quasi-Newton methods of absolute optimization. // Computer Research and Modeling. — 2016. — V. 8, no. 1. — P. 55. DOI: 10.20537/2076-7633-2016-8-1-55-78 , .
- Direct multiplicative methods for sparse matrices. Newton methods. // Computer Research and Modeling. — 2017. — V. 9, no. 5. — P. 679. DOI: 10.20537/2076-7633-2017-9-5-679-703 .
Indexed in Scopus
Full-text version of the journal is also available on the web site of the scientific electronic library eLIBRARY.RU
The journal is included in the Russian Science Citation Index
The journal is included in the RSCI
International Interdisciplinary Conference "Mathematics. Computing. Education"