Accelerated conjugate direction methods for unconstrained optimization
type: Item
instance of: scholarly article
title: Accelerated conjugate direction methods for unconstrained optimization
zbMATH Open document ID: 0352.90058
DOI: 10.1007/BF00933252
author: M. L. Lenard
published in: Journal of Optimization Theory and Applications
publication date: 1978-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 41A25
zbMATH DE Number: 3548743
MaRDI profile type: Publication
cites work: Methods of conjugate gradients for solving linear systems
cites work: Q3277015
cites work: Multiplier and gradient methods
cites work: Method of dual matrices for function minimization
cites work: Conjugate Directions without Linear Searches
cites work: A conjugate direction algorithm without line searches
cites work: A method to accelerate the rate of convergence of a class of optimization algorithms
cites work: Accelerating procedures for methods of conjugate directions
cites work: The Convergence of a Class of Double-rank Minimization Algorithms
cites work: Methods of conjugate directions versus quasi-Newton methods
cites work: A Rapidly Convergent Descent Method for Minimization
cites work: Quasi-newton algorithms generate identical points
cites work: A new approach to variable metric algorithms
cites work: A Family of Variable-Metric Methods Derived by Variational Means
cites work: Conditioning of Quasi-Newton Methods for Function Minimization
cites work: Q4088210
cites work: Alternative proofs of the convergence properties of the conjugate- gradient method
cites work: An effective algorithm for minimization
full work available at URL: https://doi.org/10.1007/bf00933252
OpenAlex ID: W2025207526
description: scientific article; zbMATH DE number 3548743