Higher-order adaptive BFGS algorithm for nonconvex functions

DOI10.1016/J.CAM.2026.117523MaRDI QIDQ7250125zbMATH OpenFDO

Authors Xiangli Li, Binglan Li, Zhiling Wang

Publication date 20 May 2026

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.CAM.2026.117523

zbMATH Keywords

global convergencemodified BFGS methodprojection technique

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Methods of quasi-Newton type (90C53)

Cites work

• A Modified BFGS Algorithm for Unconstrained Optimization
• A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
• A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
• An unconstrained optimization test functions collection
• Benchmarking optimization software with performance profiles.
• Convergence Properties of the BFGS Algoritm
• scientific article; zbMATH DE number 3529352 (Why is no real title available?)
• New quasi-Newton equation and related methods for unconstrained optimization
• New quasi-Newton methods for unconstrained optimization problems
• Numerical Optimization
• Proximal variable metric method with spectral diagonal update for large scale sparse optimization
• Spectral gradient projection method for solving nonlinear monotone equations
• The BFGS method with exact line searches fails for non-convex objective functions
• The projection technique for two open problems of unconstrained optimization problems

This page was built for publication: Higher-order adaptive BFGS algorithm for nonconvex functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7250125)