A double parameter scaled BFGS method for unconstrained optimization
type: Item
instance of: scholarly article
title: A double parameter scaled BFGS method for unconstrained optimization
zbMATH Open document ID: 1422.65084
author: Neculai Andrei
published in: Journal of Computational and Applied Mathematics
publication date: 2017-11-21T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 6810534
zbMATH Keywords: unconstrained optimization
zbMATH Keywords: scaled BFGS method
zbMATH Keywords: self-correcting quality
zbMATH Keywords: global convergence
zbMATH Keywords: numerical comparisons
describes a project that uses: CUTEr
describes a project that uses: SCALCG
MaRDI profile type: Publication
full work available at URL: j.cam.2017.10.009
OpenAlex ID: W2766909038
cites work: The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
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: Convergence Conditions for Ascent Methods
cites work: Convergence Conditions for Ascent Methods. II: Some Corrections
cites work: A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
cites work: Quasi-Newton Methods, Motivation and Theory
cites work: Q4016506
cites work: Q4107408
cites work: Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
cites work: A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
cites work: Variable metric algorithms: Necessary and sufficient conditions for identical behaviour of nonquadratic functions
cites work: The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients
cites work: On the Convergence of the Variable Metric Algorithm
cites work: The BFGS method with exact line searches fails for non-convex objective functions
cites work: Convergence Properties of the BFGS Algoritm
cites work: Q4840579
cites work: Updating conjugate directions by the BFGS formula
cites work: Reduced-Hessian quasi-Newton methods for unconstrained optimization
cites work: Self-Scaling Variable Metric (SSVM) Algorithms
cites work: Analysis of a self-scaling quasi-Newton method
cites work: Global and superlinear convergence of a restricted class of self-scaling methods with inexact line searches, for convex functions
cites work: Numerical expirience with a class of self-scaling quasi-Newton algorithms
cites work: Minimization Algorithms Making Use of Non-quadratic Properties of the Objective Function
cites work: A Note on Minimization Algorithms which make Use of Non-quardratic Properties of the Objective Function
cites work: A Modified BFGS Algorithm for Unconstrained Optimization
cites work: Modifying the BFGS method
cites work: Matrix conditioning and nonlinear optimization
cites work: Spectral scaling BFGS method
cites work: Two-Point Step Size Gradient Methods
cites work: Properties and numerical performance of quasi-Newton methods with modified quasi-Newton equations
cites work: Automatic Column Scaling Strategies for Quasi-Newton Methods
cites work: Modifying the BFGS update by a new column scaling technique
cites work: A modified BFGS method and its global convergence in nonconvex minimization
cites work: How bad are the BFGS and DFP methods when the objective function is quadratic?
cites work: CUTE
cites work: Methods of conjugate gradients for solving linear systems
cites work: Optimization theory and methods. Nonlinear programming
cites work: On the Behavior of Broyden’s Class of Quasi-Newton Methods
cites work: Eigenvalues versus singular values study in conjugate gradient algorithms for large-scale unconstrained optimization
cites work: Q4051876
cites work: Conjugate Gradient Methods with Inexact Searches
cites work: Q3539529
cites work: Benchmarking optimization software with performance profiles.
cites work: The superlinear convergence of a modified BFGS-type method for unconstrained optimization
cites work: Convergence analysis of a modified BFGS method on convex minimizations
cites work: Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
DOI: 10.1016/J.CAM.2017.10.009
description: scientific article; zbMATH DE number 6810534