Unified approach to unconstrained minimization via basic matrix factorizations
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3476911 (Why is no real title available?)
- scientific article; zbMATH DE number 3526471 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- scientific article; zbMATH DE number 3331230 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- A comparison of modified Newton methods for unconstrained optimisation
- A conjugate direction algorithm without line searches
- 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
- Conjugate Directions without Linear Searches
- Methods for Modifying Matrix Factorizations
- On Isometries of Euclidean Spaces
- On the Relative Efficiencies of Gradient Methods
- On variable-metric algorithms
- Optimally conditioned optimization algorithms without line searches
- Quasi Newton techniques generate identical points II: The proofs of four new theorems
- Recent advances in unconstrained optimization
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
- Unified approach to quadratically convergent algorithms for function minimization
Cited in
(2)
This page was built for publication: Unified approach to unconstrained minimization via basic matrix factorizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1242195)
