A new diagonal quasi-Newton algorithm for unconstrained optimization problems.

DOI10.21136/am.2024.0045-24MaRDI QIDQ6648031

Keyvan Amini, Mahsa Nosrati

Publication date: 4 December 2024

Published in: Applications of Mathematics (Search for Journal in Brave)

zbMATH Keywords

unconstrained optimizationglobal convergenceweak secant equationdiagonal quasi-Newton method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Diagonal quasi-Newton methods via least change updating principle with weighted Frobenius norm
• A diagonal quasi-Newton updating method for unconstrained optimization
• An acceleration of gradient descent algorithm with backtracking for unconstrained opti\-mi\-za\-tion
• Minimization of functions having Lipschitz continuous first partial derivatives
• The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
• Sizing and Least-Change Secant Methods
• Preconditioning of Truncated-Newton Methods
• Two-Point Step Size Gradient Methods
• Updating Quasi-Newton Matrices with Limited Storage
• Quasi-Newton Methods, Motivation and Theory
• CUTE
• A diagonal quasi-Newton updating method based on minimizing the measure function of Byrd and Nocedal for unconstrained optimization
• The Quasi-Cauchy Relation and Diagonal Updating
• On the Local and Superlinear Convergence of Quasi-Newton Methods
• A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
• A new accelerated diagonal quasi-Newton updating method with scaled forward finite differences directional derivative for unconstrained optimization
• Convergence Conditions for Ascent Methods
• On Steepest Descent
• A New Algorithm for Unconstrained Optimization
• Benchmarking optimization software with performance profiles.

This page was built for publication: A new diagonal quasi-Newton algorithm for unconstrained optimization problems.