A restarting approach for the symmetric rank one update for unconstrained optimization

DOI10.1007/S10589-007-9115-ZzbMATH Open1211.90292OpenAlexW2023683585MaRDI QIDQ632383FDOQ632383

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

Publication date: 24 March 2011

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-007-9115-z

Recommendations

• A symmetric rank-one method based on extra updating techniques for unconstrained optimization
• On the performance of a new symmetric rank-one method with restart for solving unconstrained optimization problems
• Measures for Symmetric Rank-One Updates
• A new approach to symmetric rank-one updating
• Convergence of a positive definite symmetric rank one method with restart

zbMATH Keywords

unconstrained optimizationsymmetric rank onevolume of ellipsoid

Mathematics Subject Classification ID

Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)

Cites Work

• Testing Unconstrained Optimization Software
• Title not available (Why is that?)
• Convergence of quasi-Newton matrices generated by the symmetric rank one update
• Sizing and Least-Change Secant Methods
• Matrix conditioning and nonlinear optimization
• A Theoretical and Experimental Study of the Symmetric Rank-One Update
• A new approach to symmetric rank-one updating
• Title not available (Why is that?)
• Measures for Symmetric Rank-One Updates
• Optimal Conditioning and Convergence in Rank One Quasi-Newton Updates
• A modified rank one update which converges \(Q\)-superlinearly

Cited In (10)

• Convergence of a positive definite symmetric rank one method with restart
• Maximum entropy derivation of quasi-Newton methods
• Improved Hessian approximation with modified secant equations for symmetric rank-one method
• Scaled memoryless symmetric rank one method for large-scale optimization
• A sufficient descent three-term conjugate gradient method via symmetric rank-one update for large-scale optimization
• Nonmonotone spectral gradient method based on memoryless symmetric rank-one update for large-scale unconstrained optimization
• On the performance of a new symmetric rank-one method with restart for solving unconstrained optimization problems
• Structured symmetric rank-one method for unconstrained optimization
• A symmetric rank-one method based on extra updating techniques for unconstrained optimization
• Title not available (Why is that?)

Uses Software

• Algorithm 500
• minpack

This page was built for publication: A restarting approach for the symmetric rank one update for unconstrained optimization

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