<p>Correlation and realization of quasi-Newton methods of absolute optimization</p>

Sviridenko A.B.; Zelenkov G.A.

Issue 1, 2016 Vol. 8

All issues

2024 Vol. 16
- Issue 5
- Issue 4
- Issue 3
- Issue 2
- Issue 1 (special issue)
2023 Vol. 15
- Issue 6
- Issue 5
- Issue 4 (special issue)
- Issue 3
- Issue 2 (special issue)
- Issue 1
2022 Vol. 14
- Issue 6
- Issue 5
- Issue 4 (special issue)
- Issue 3
- Issue 2 (special issue)
- Issue 1
2021 Vol. 13
- Issue 6
- Issue 5
- Issue 4
- Issue 3
- Issue 2 (special issue)
- Issue 1
2020 Vol. 12
- Issue 6
- Issue 5
- Issue 4
- Issue 3
- Issue 2
- Issue 1
2019 Vol. 11
- Issue 6
- Issue 5
- Issue 4
- Issue 3
- Issue 2
- Issue 1
2018 Vol. 10
- Issue 6
- Issue 5 (special issue)
- Issue 4
- Issue 3 (special issue)
- Issue 2
- Issue 1
2017 Vol. 9
- Issue 6
- Issue 5
- Issue 4
- Issue 3
- Issue 2
- Issue 1
2016 Vol. 8
- Issue 6
- Issue 5
- Issue 4
- Issue 3
- Issue 2
- Issue 1
2015 Vol. 7
- Issue 6
- Issue 5
- Issue 4
- Issue 3 (special issue)
- Issue 2
- Issue 1
2014 Vol. 6
- Issue 6 (special issue)
- Issue 5
- Issue 4
- Issue 3
- Issue 2
- Issue 1
2013 Vol. 5
- Issue 6 (special issue)
- Issue 5
- Issue 4
- Issue 3
- Issue 2
- Issue 1
2012 Vol. 4
- Issue 4
- Issue 3
- Issue 2
- Issue 1
2011 Vol. 3
- Issue 4
- Issue 3
- Issue 2
- Issue 1
2010 Vol. 2
- Issue 4
- Issue 3
- Issue 2
- Issue 1
2009 Vol. 1
- Issue 4
- Issue 3
- Issue 2
- Issue 1

Correlation and realization of quasi-Newton methods of absolute optimization

Sviridenko A.B., Zelenkov G.A.

pdf (626K) / List of references / Supplementary information

Newton and quasi-Newton methods of absolute optimization based on Cholesky factorization with adaptive step and finite difference approximation of the first and the second derivatives. In order to raise effectiveness of the quasi-Newton methods a modified version of Cholesky decomposition of quasi-Newton matrix is suggested. It solves the problem of step scaling while descending, allows approximation by non-quadratic functions, and integration with confidential neighborhood method. An approach to raise Newton methods effectiveness with finite difference approximation of the first and second derivatives is offered. The results of numerical research of algorithm effectiveness are shown.

Keywords: Newton methods, quasi-Newton methods, Cholesky factorization, step scaling, method of confidence neighborhoods, finite difference approximation, algorithm, numerical research, absolute optimization

Citation in English: Sviridenko A.B., Zelenkov G.A. Correlation and realization of quasi-Newton methods of absolute optimization // Computer Research and Modeling, 2016, vol. 8, no. 1, pp. 55-78

DOI: 10.20537/2076-7633-2016-8-1-55-78

URL: http://crm-en.ics.org.ru/journal/article/2411/

Supplementary information:

Application KNmbm – software implementation of quasi-Newton optimization methods with step regulation, based on the Cholesky factorization. The algorithm is implemented in the Visual Basic .NET language, development environment is Microsoft Visual Studio 2010. Options quasi-Newton methods: symmetric rank-one formula, BFGS, DFP, PSB.

KNMBM.zip

Application KNmbmApp – software implementation of quasi-Newton optimization methods with step regulation, based on the Cholesky factorization. KNmbmApp different from its classical prototype KNmbm finite-difference approximation of the first derivatives. The algorithm is implemented in the Visual Basic .NET language, development environment is Microsoft Visual Studio 2010. Options quasi-Newton methods: symmetric rank-one formula, BFGS, DFP, PSB.

KNMBMApp.zip

Application Nmbm (Sviridenko A.B. Certificate №2015610399 from 01.12.2015) – a software implementation of Newton optimization methods with step regulation, based on the Cholesky factorization. The algorithm is implemented in the Visual Basic .NET language, development environment is Microsoft Visual Studio 2010.

NMBM.zip

Application NmbmApp (A.B. Sviridenko, G.A. Zelenkov Certificate №2015610347 of 01.12.2015) – a software implementation of Newton optimization methods with step regulation, based on the Cholesky factorization. NmbmApp different from its classical prototype Nmbm (Sviridenko A.B. Certificate №2015610399 from 01.12.2015) finite-difference approximation of the first and second derivatives. The algorithm is implemented in the Visual Basic .NET language, development environment is Microsoft Visual Studio 2010.

NMBMApp.zip

Computer Research and Modeling - 2016 - Issue 1

This work is licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License.

According to Crossref, this article is cited by:

Anastasiya Borisovna Sviridenko. 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

Please note that citation information may be incomplete as it includes data from Crossref cited-by program partners only.

Views (last year): 7. Citations: 5 (RSCI).

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"