Self-Scaling Variable Metric Algorithms without Line Search for Unconstrained Minimization
type: Item
instance of: scholarly article
zbMATH Open document ID: 0304.65045
DOI: 10.2307/2005523
author: Shmuel S. Oren
publication date: 1973-01-01T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 3476494
MaRDI profile type: MaRDI publication profile
full work available at URL: https://doi.org/10.2307/2005523
OpenAlex ID: W4251660957
title: Self-Scaling Variable Metric Algorithms without Line Search for Unconstrained Minimization
cites work: On a Numerical Instability of Davidon-Like Methods
cites work: Quasi-Newton Methods and their Application to Function Minimisation
cites work: The Convergence of a Class of Double-rank Minimization Algorithms
cites work: Variance algorithm for minimization
cites work: Variable metric algorithms: Necessary and sufficient conditions for identical behaviour of nonquadratic functions
cites work: A Rapidly Convergent Descent Method for Minimization
cites work: A new approach to variable metric algorithms
cites work: Quasi-Newton Methods for Unconstrained Optimization
cites work: On Steepest Descent
cites work: Variations on Variable-Metric Methods
cites work: Q4095751
cites work: Unified approach to quadratically convergent algorithms for function minimization
cites work: Q5332414
cites work: Q4051876
cites work: Self-Scaling Variable Metric (SSVM) Algorithms
cites work: Q4101629
cites work: Recent advances in unconstrained optimization
description: scientific article