diagonal updating
Recently Published Documents


TOTAL DOCUMENTS

6
(FIVE YEARS 0)

H-INDEX

2
(FIVE YEARS 0)

2018 ◽  
Vol 103 (10) ◽  
pp. 1619-1629 ◽  
Author(s):  
I. M. Sulaiman ◽  
M. Mamat ◽  
M. A. Mohamed ◽  
M. Y. Waziri

2013 ◽  
Vol 2013 ◽  
pp. 1-5 ◽  
Author(s):  
Mahboubeh Farid ◽  
Wah June Leong ◽  
Najmeh Malekmohammadi ◽  
Mustafa Mamat

We present a new gradient method that uses scaling and extra updating within the diagonal updating for solving unconstrained optimization problem. The new method is in the frame of Barzilai and Borwein (BB) method, except that the Hessian matrix is approximated by a diagonal matrix rather than the multiple of identity matrix in the BB method. The main idea is to design a new diagonal updating scheme that incorporates scaling to instantly reduce the large eigenvalues of diagonal approximation and otherwise employs extra updates to increase small eigenvalues. These approaches give us a rapid control in the eigenvalues of the updating matrix and thus improve stepwise convergence. We show that our method is globally convergent. The effectiveness of the method is evaluated by means of numerical comparison with the BB method and its variant.


2013 ◽  
Vol 2013 ◽  
pp. 1-6 ◽  
Author(s):  
Mohammed Yusuf Waziri ◽  
Zanariah Abdul Majid

We present a new diagonal quasi-Newton update with an improved diagonal Jacobian approximation for solving large-scale systems of nonlinear equations. In this approach, the Jacobian approximation is derived based on the quasi-Cauchy condition. The anticipation has been to further improve the performance of diagonal updating, by modifying the quasi-Cauchy relation so as to carry some additional information from the functions. The effectiveness of our proposed scheme is appraised through numerical comparison with some well-known Newton-like methods.


2012 ◽  
Vol 2012 ◽  
pp. 1-11 ◽  
Author(s):  
Mahboubeh Farid ◽  
Wah June Leong ◽  
Lihong Zheng

This paper focuses on developing diagonal gradient-type methods that employ accumulative approach in multistep diagonal updating to determine a better Hessian approximation in each step. The interpolating curve is used to derive a generalization of the weak secant equation, which will carry the information of the local Hessian. The new parameterization of the interpolating curve in variable space is obtained by utilizing accumulative approach via a norm weighting defined by two positive definite weighting matrices. We also note that the storage needed for all computation of the proposed method is justO(n). Numerical results show that the proposed algorithm is efficient and superior by comparison with some other gradient-type methods.


1999 ◽  
Vol 9 (4) ◽  
pp. 1192-1204 ◽  
Author(s):  
M. Zhu ◽  
J. L. Nazareth ◽  
H. Wolkowicz

Sign in / Sign up

Export Citation Format

Share Document