Convergence of a positive definite symmetric rank one method with restart

zbMATH Open1175.65072MaRDI QIDQ3397697FDOQ3397697

Authors W. J. Leong, M. A. Hassan

Publication date 22 September 2009

zbMATH Keywords

convergence propertiessymmetric rank one methodunconstraint optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Methods of quasi-Newton type (90C53)

Recommendations

• Convergence of Symmetric Rank-One method based on Modified Quasi-Newton equation
• Positive-definite memoryless symmetric rank one method for large-scale unconstrained optimization
• A restarting approach for the symmetric rank one update for unconstrained optimization
• Analysis of a Symmetric Rank-One Trust Region Method
• A symmetric rank-one method based on extra updating techniques for unconstrained optimization

Cited in

(3)

• A restarting approach for the symmetric rank one update for unconstrained optimization
• Descent line search scheme using Geršgorin circle theorem
• Local convergence of the symmetric rank-one iteration

This page was built for publication: Convergence of a positive definite symmetric rank one method with restart

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3397697)