Generating conjugate directions without line searches using factorized variable metric updating formulas

DOI10.1007/BF01584327zbMATH Open0394.90089OpenAlexW2050409922MaRDI QIDQ4177352FDOQ4177352

Authors: Donald Goldfarb 

Publication date: 1977

Published in: Mathematical Programming (Search for Journal in Brave)

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

zbMATH Keywords

AlgorithmComputational EfficiencyConjugate DirectionsFactorized Variable Metric

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Cites Work

• Variable Metric Method for Minimization
• A Rapidly Convergent Descent Method for Minimization
• An efficient method for finding the minimum of a function of several variables without calculating derivatives
• Function minimization by conjugate gradients
• A Family of Variable-Metric Methods Derived by Variational Means
• A new approach to variable metric algorithms
• Conditioning of Quasi-Newton Methods for Function Minimization
• Nested Dissection of a Regular Finite Element Mesh
• Newton-type methods for unconstrained and linearly constrained optimization
• Title not available (Why is that?)
• Quasi-Newton Methods and their Application to Function Minimisation
• Conjugate Directions without Linear Searches
• Optimally conditioned optimization algorithms without line searches
• Numerical Solution of the Minimal Surface Equation
• Quadratic Termination Properties of Minimization Algorithms I. Statement and Discussion of Results
• NOTES ON THE SOLUTION OF ALGEBRAIC LINEAR SIMULTANEOUS EQUATIONS
• Factorized Variable Metric Methods for Unconstrained Optimization
• Title not available (Why is that?)
• A modified Newton method for minimization
• Quasi-Newton Methods for Unconstrained Optimization
• Conjugate Gradient Algorithms: Quadratic Termination without Linear Searches
• A method to accelerate the rate of convergence of a class of optimization algorithms
• Accelerating procedures for methods of conjugate directions

Cited In (2)

• On Variable-Metric Methods for Sparse Hessians
• Computational experience with methods for estimating sparse hessians for nonlinear optimization

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)