Eigenvalues and switching algorithms for Quasi-Newton updates
From MaRDI portal
Publication:4375436
DOI10.1080/02331939708844359zbMath0892.49017OpenAlexW2077618115MaRDI QIDQ4375436
Publication date: 19 July 1998
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939708844359
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Nonlinear programming (90C30) Eigenvalue problems (93B60) Methods of reduced gradient type (90C52)
Related Items (4)
On the performance of a new symmetric rank-one method with restart for solving unconstrained optimization problems ⋮ 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 ⋮ A symmetric rank-one quasi-Newton line-search method using negative curvature directions
Uses Software
Cites Work
- Unnamed Item
- On the limited memory BFGS method for large scale optimization
- Convergence of quasi-Newton matrices generated by the symmetric rank one update
- Variational quasi-Newton methods for unconstrained optimization
- Unified approach to quadratically convergent algorithms for function minimization
- Numerical Experience with Limited-Memory Quasi-Newton and Truncated Newton Methods
- Least Change Secant Updates for Quasi-Newton Methods
- Testing Unconstrained Optimization Software
- A Theoretical and Experimental Study of the Symmetric Rank-One Update
- On the Local and Superlinear Convergence of Quasi-Newton Methods
- A Rapidly Convergent Descent Method for Minimization
- A new approach to variable metric algorithms
- Minimization Algorithms Making Use of Non-quadratic Properties of the Objective Function
- Quasi-newton algorithms generate identical points
This page was built for publication: Eigenvalues and switching algorithms for Quasi-Newton updates
