Method of dual matrices for function minimization
From MaRDI portal
Publication:2560773
DOI10.1007/BF00933042zbMath0261.90066OpenAlexW2041014576MaRDI QIDQ2560773
Publication date: 1974
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00933042
Related Items (2)
One class of dual matrix methods ⋮ Accelerated conjugate direction methods for unconstrained optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unified approach to quadratically convergent algorithms for function minimization
- Numerical experiments on quadratically convergent algorithms for function minimization
- Properties of the conjugate-gradient and Davidon methods
- Unconstrained approach to the extremization of constrained functions
- Quadratically convergent algorithms and one-dimensional search schemes
- A Rapidly Convergent Descent Method for Minimization
- Function minimization by conjugate gradients
- Quasi-Newton Methods and their Application to Function Minimisation
- Computational experience with quadratically convergent minimisation methods
- A new approach to variable metric algorithms
- Methods of conjugate gradients for solving linear systems
This page was built for publication: Method of dual matrices for function minimization
