On optimality of the parameters of self-scaling memoryless quasi-Newton updating formulae
type: Item
instance of: scholarly article
title: On optimality of the parameters of self-scaling memoryless quasi-Newton updating formulae
zbMATH Open document ID: 1327.90394
author: Saman Babaie-Kafaki
published in: Journal of Optimization Theory and Applications
publication date: 2015-10-28T00:00:00Z
Mathematics Subject Classification ID: 90C53
Mathematics Subject Classification ID: 49M37
Mathematics Subject Classification ID: 65F15
zbMATH DE Number: 6499448
zbMATH Keywords: unconstrained optimization
zbMATH Keywords: large-scale optimization
zbMATH Keywords: memoryless quasi-Newton update
zbMATH Keywords: eigenvalue
zbMATH Keywords: condition number
describes a project that uses: SCALCG
MaRDI profile type: Publication
full work available at URL: s10957-015-0724-x
OpenAlex ID: W2042877555
cites work: Optimization theory and methods. Nonlinear programming
cites work: Convergence Conditions for Ascent Methods
cites work: Self-Scaling Variable Metric (SSVM) Algorithms
cites work: Optimal conditioning of self-scaling variable Metric algorithms
cites work: The global convergence of self-scaling BFGS algorithm with non-monotone line search for unconstrained nonconvex optimization problems
cites work: Two-Point Step Size Gradient Methods
cites work: A scaled BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
cites work: Scaled conjugate gradient algorithms for unconstrained optimization
cites work: Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
cites work: A scaled nonlinear conjugate gradient algorithm for unconstrained optimization
cites work: Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
cites work: A note on the global convergence theorem of the scaled conjugate gradient algorithms proposed by Andrei
cites work: Q4908846
cites work: A modified scaled memoryless BFGS preconditioned conjugate gradient method for unconstrained optimization
cites work: Two modified scaled nonlinear conjugate gradient methods
cites work: A modified scaled conjugate gradient method with global convergence for nonconvex functions
cites work: A modified BFGS method and its global convergence in nonconvex minimization
cites work: A nonlinear conjugate gradient method based on the MBFGS secant condition
cites work: New quasi-Newton equation and related methods for unconstrained optimization
cites work: Properties and numerical performance of quasi-Newton methods with modified quasi-Newton equations
cites work: Two new conjugate gradient methods based on modified secant equations
cites work: Q4836791
cites work: New quasi-Newton methods for unconstrained optimization problems
cites work: A modified BFGS algorithm based on a hybrid secant equation
cites work: New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
cites work: A Modified BFGS Algorithm for Unconstrained Optimization
cites work: A Nonlinear Conjugate Gradient Algorithm with an Optimal Property and an Improved Wolfe Line Search
cites work: Q3148987
cites work: A quadratic hybridization of Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods
cites work: Benchmarking optimization software with performance profiles.
cites work: Open problems in nonlinear conjugate gradient algorithms for unconstrained optimization
DOI: 10.1007/S10957-015-0724-X
description: scientific article; zbMATH DE number 6499448