Unified approach to unconstrained minimization via basic matrix factorizations

DOI10.1016/0024-3795(77)90062-3zbMath0367.15012OpenAlexW2031261788WikidataQ114215341 ScholiaQ114215341MaRDI QIDQ1242195

Larry Nazareth

Publication date: 1977

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(77)90062-3

Mathematics Subject Classification ID

Matrix equations and identities (15A24) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items

A conjugate direction algorithm without line searches ⋮ A family of variable metric updates

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A conjugate direction algorithm without line searches
• Unified approach to quadratically convergent algorithms for function minimization
• On variable-metric algorithms
• An Iterative Method for Finding Stationary Values of a Function of Several Variables
• Analogues of Dixon’s and Powell’s Theorems for Unconstrained Minimization with Inexact Line Searches
• Optimally conditioned optimization algorithms without line searches
• Methods for Modifying Matrix Factorizations
• On the Relative Efficiencies of Gradient Methods
• The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
• A comparison of modified Newton methods for unconstrained optimisation
• Recent advances in unconstrained optimization
• Quasi Newton techniques generate identical points II: The proofs of four new theorems
• Conjugate Directions without Linear Searches
• On Isometries of Euclidean Spaces