Generating conjugate directions without line searches using factorized variable metric updating formulas
From MaRDI portal
Publication:4177352
Cites work
- scientific article; zbMATH DE number 3430031 (Why is no real title available?)
- scientific article; zbMATH DE number 3101142 (Why is no real title available?)
- A Family of Variable-Metric Methods Derived by Variational Means
- A Rapidly Convergent Descent Method for Minimization
- A method to accelerate the rate of convergence of a class of optimization algorithms
- A modified Newton method for minimization
- A new approach to variable metric algorithms
- Accelerating procedures for methods of conjugate directions
- An efficient method for finding the minimum of a function of several variables without calculating derivatives
- Conditioning of Quasi-Newton Methods for Function Minimization
- Conjugate Directions without Linear Searches
- Conjugate Gradient Algorithms: Quadratic Termination without Linear Searches
- Factorized Variable Metric Methods for Unconstrained Optimization
- Function minimization by conjugate gradients
- NOTES ON THE SOLUTION OF ALGEBRAIC LINEAR SIMULTANEOUS EQUATIONS
- Nested Dissection of a Regular Finite Element Mesh
- Newton-type methods for unconstrained and linearly constrained optimization
- Numerical Solution of the Minimal Surface Equation
- Optimally conditioned optimization algorithms without line searches
- Quadratic Termination Properties of Minimization Algorithms I. Statement and Discussion of Results
- Quasi-Newton Methods and their Application to Function Minimisation
- Quasi-Newton Methods for Unconstrained Optimization
- Variable Metric Method for Minimization
Cited in
(2)
This page was built for publication: Generating conjugate directions without line searches using factorized variable metric updating formulas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4177352)
