Supermemory descent methods for unconstrained minimization
type: Item
instance of: scholarly article
title: Supermemory descent methods for unconstrained minimization
zbMATH Open document ID: 0304.49023
DOI: 10.1007/BF00932655
author: S. Singh
published in: Journal of Optimization Theory and Applications
publication date: 1976-01-01T00:00:00Z
Mathematics Subject Classification ID: 49M15
Mathematics Subject Classification ID: 90C99
zbMATH DE Number: 3476188
MaRDI profile type: Publication
cites work: Study on a supermemory gradient method for the minimization of functions
cites work: Memory gradient method for the minimization of functions
cites work: Function minimization by conjugate gradients
cites work: A Quasi-Newton Method with Memory for Unconstrained Function Minimization
cites work: A Rapidly Convergent Descent Method for Minimization
cites work: Variable Metric Method for Minimization
cites work: A multipoint method of third order
cites work: Variable metric methods of minimisation
cites work: An Iterative Method for Finding Stationary Values of a Function of Several Variables
cites work: A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems
cites work: Minimization Algorithms Making Use of Non-quadratic Properties of the Objective Function
cites work: Conjugate Directions without Linear Searches
full work available at URL: https://doi.org/10.1007/bf00932655
OpenAlex ID: W2015377485
description: scientific article; zbMATH DE number 3476188