Journal of Mathematics Research
Convergence of Symmetric Rank-One method based on Modified Quasi-Newton equation
Abstract
In this paper we investigate on convergence rate of a modified symmetric rank-one (SR1) method for unconstrained
optimization problems. In general, the modified SR1 method incorporates a modified secant equation
into the standard SR1 method. Also a restart procedure is applied to avoid the loss of positive definiteness and zero denominator.
A remarkable feature of the modified SR1 method is that it possesses at most $n+1$-step $q$-superlinearly convergent and
$2n$-step quadratic convergent without uniformly independent assumptions of steps.
optimization problems. In general, the modified SR1 method incorporates a modified secant equation
into the standard SR1 method. Also a restart procedure is applied to avoid the loss of positive definiteness and zero denominator.
A remarkable feature of the modified SR1 method is that it possesses at most $n+1$-step $q$-superlinearly convergent and
$2n$-step quadratic convergent without uniformly independent assumptions of steps.
This work is licensed under a Creative Commons Attribution 3.0 License.
Journal of Mathematics Research ISSN 1916-9795 (Print) ISSN 1916-9809 (Online)
Copyright © Canadian Center of Science and Education
To make sure that you can receive messages from us, please add the 'ccsenet.org' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.