A new approach to symmetric rank-one updating

DOI10.1093/imanum/19.4.497zbMath0940.65071OpenAlexW1998724010MaRDI QIDQ4937501

Linping Sun, Michael R. Osborne

Publication date: 10 July 2000

Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/imanum/19.4.497

zbMATH Keywords

unconstrained optimizationnumerical experimentssymmetric rank-one updating

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)

Related Items (10)

On the performance of a new symmetric rank-one method with restart for solving unconstrained optimization problems ⋮ Limited memory methods with improved symmetric rank-one updates and its applications on nonlinear image restoration ⋮ Improved Hessian approximation with modified secant equations for symmetric rank-one method ⋮ A restarting approach for the symmetric rank one update for unconstrained optimization ⋮ A proximal quasi-Newton method based on memoryless modified symmetric rank-one formula ⋮ A symmetric rank-one method based on extra updating techniques for unconstrained optimization ⋮ A new quasi-Newton pattern search method based on symmetric rank-one update for unconstrained optimization ⋮ Stochastic proximal quasi-Newton methods for non-convex composite optimization ⋮ L-Broyden methods: a generalization of the L-BFGS method to the limited-memory Broyden family ⋮ Variable metric methods for unconstrained optimization and nonlinear least squares

This page was built for publication: A new approach to symmetric rank-one updating