Scaled memoryless symmetric rank one method for large-scale optimization
type: Item
instance of: scholarly article
title: Scaled memoryless symmetric rank one method for large-scale optimization
zbMATH Open document ID: 1226.65054
author: W. J. Leong
author: M. A. Hassan
published in: Applied Mathematics and Computation
publication date: 2011-10-11T00:00:00Z
full work available at URL: Scaled memoryless symmetric rank one method for large.pdf
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C06
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 5956398
zbMATH Keywords: large-scale optimization
zbMATH Keywords: memoryless quasi-Newton method
zbMATH Keywords: symmetric rank one update
zbMATH Keywords: optimal scaling
zbMATH Keywords: unconstrained optimization
zbMATH Keywords: numerical results
describes a project that uses: CUTEr
describes a project that uses: minpack
describes a project that uses: L-BFGS
describes a project that uses: CUTE
MaRDI profile type: Publication
OpenAlex ID: W2045176326
cites work: CUTE
cites work: Convergence of quasi-Newton matrices generated by the symmetric rank one update
cites work: Sizing and Least-Change Secant Methods
cites work: Improved Hessian approximation with modified secant equations for symmetric rank-one method
cites work: Global Convergence Properties of Conjugate Gradient Methods for Optimization
cites work: A Theoretical and Experimental Study of the Symmetric Rank-One Update
cites work: A restarting approach for the symmetric rank one update for unconstrained optimization
cites work: A new gradient method via least change secant update
cites work: On the limited memory BFGS method for large scale optimization
cites work: Testing Unconstrained Optimization Software
cites work: Line search algorithms with guaranteed sufficient decrease
cites work: Optimal conditioning of self-scaling variable Metric algorithms
cites work: Conjugate Gradient Methods with Inexact Searches
cites work: Matrix conditioning and nonlinear optimization
cites work: Convergence Conditions for Ascent Methods
cites work: Measures for Symmetric Rank-One Updates
DOI: 10.1016/J.AMC.2011.05.080
Recommended article: Q3076647
Recommended article: Q3640943
Recommended article: Updating the self-scaling symmetric rank one algorithm with limited memory for large-scale unconstrained optimization
Recommended article: A modified scaled memoryless symmetric rank-one method
Recommended article: A MEMORYLESS SYMMETRIC RANK-ONE METHOD WITH SUFFICIENT DESCENT PROPERTY FOR UNCONSTRAINED OPTIMIZATION
Recommended article: Structured symmetric rank-one method for unconstrained optimization
Recommended article: Nonmonotone spectral gradient method based on memoryless symmetric rank-one update for large-scale unconstrained optimization
Recommended article: Scaled memoryless BFGS preconditioned steepest descent method for very large-scale unconstrained optimization
Recommended article: Q5479896
Recommended article: Non-Euclidean restricted memory level method for large-scale convex optimization
description: scientific article; zbMATH DE number 5956398