A restarting approach for the symmetric rank one update for unconstrained optimization
From MaRDI portal
Publication:632383
DOI10.1007/s10589-007-9115-zzbMath1211.90292OpenAlexW2023683585MaRDI QIDQ632383
Malik Abu Hassan, Wah June Leong
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
Related Items (8)
On the performance of a new symmetric rank-one method with restart for solving unconstrained optimization problems ⋮ Nonmonotone spectral gradient method based on memoryless symmetric rank-one update for large-scale unconstrained optimization ⋮ Improved Hessian approximation with modified secant equations for symmetric rank-one method ⋮ A symmetric rank-one method based on extra updating techniques for unconstrained optimization ⋮ 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 ⋮ Structured symmetric rank-one method for unconstrained optimization ⋮ Maximum Entropy Derivation of Quasi-Newton Methods
Uses Software
Cites Work
- Convergence of quasi-Newton matrices generated by the symmetric rank one update
- Sizing and Least-Change Secant Methods
- Optimal Conditioning and Convergence in Rank One Quasi-Newton Updates
- Testing Unconstrained Optimization Software
- Matrix conditioning and nonlinear optimization
- A Theoretical and Experimental Study of the Symmetric Rank-One Update
- Measures for Symmetric Rank-One Updates
- A new approach to symmetric rank-one updating
- A modified rank one update which converges \(Q\)-superlinearly
- Unnamed Item
- Unnamed Item
This page was built for publication: A restarting approach for the symmetric rank one update for unconstrained optimization
