Secant relations versus positive definiteness in quasi-Newton methods

DOI10.1007/BF00938401zbMath0534.90068OpenAlexW2087978208MaRDI QIDQ790711

Ury Passy, Eliezer Z. Prisman

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1007/bf00938401

zbMATH Keywords

unconstrained optimizationquasi-Newton methodsapproximation of the Hessian inversenonsymmetric nonpositive-definite matrix

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On variable-metric algorithms
• The Secant method for simultaneous nonlinear equations
• An Iterative Method for Finding Stationary Values of a Function of Several Variables
• Quasi-Newton Methods, Motivation and Theory
• A Rapidly Convergent Descent Method for Minimization
• Quasi-Newton Methods and their Application to Function Minimisation
• A Family of Variable-Metric Methods Derived by Variational Means
• The Convergence of a Class of Double-rank Minimization Algorithms
• A new approach to variable metric algorithms
• Conditioning of Quasi-Newton Methods for Function Minimization
• Minimization Algorithms Making Use of Non-quadratic Properties of the Objective Function
• A KDF9 ALGOL list-processing scheme