A limited memory BFGS algorithm for non-convex minimization with applications in matrix largest eigenvalue problem

DOI10.1007/S00186-015-0527-8zbMath1336.90088OpenAlexW2214007837MaRDI QIDQ283997

Guanyu Yang, Zhanwen Shi, Yun-hai Xiao

Publication date: 17 May 2016

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-015-0527-8

zbMATH Keywords

unconstrained optimizationglobal convergencecritical pointArmijo line searchlargest eigenvalue problemlimited memory BFGS method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)

Related Items (2)

A hybrid iterated local search algorithm with adaptive perturbation mechanism by success-history based parameter adaptation for differential evolution (SHADE) ⋮ A limited memory \(q\)-BFGS algorithm for unconstrained optimization problems

Uses Software

• Unnamed Item
• L-BFGS
• eigs
• JDQR
• SparseMatrix
• JDQZ
• CUTE

Cites Work

• Unnamed Item
• Global convergence of a modified limited memory BFGS method for non-convex minimization
• Duality for non-convex variational principles
• On the limited memory BFGS method for large scale optimization
• Global convergence of the nonmonotone MBFGS method for nonconvex unconstrained minimization
• Notes on the Dai-Yuan-Yuan modified spectral gradient method
• A limited memory BFGS-type method for large-scale unconstrained optimization
• Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization
• New quasi-Newton equation and related methods for unconstrained optimization
• The BFGS method with exact line searches fails for non-convex objective functions
• Computing eigenelements of real symmetric matrices via optimization
• The superlinear convergence of a modified BFGS-type method for unconstrained optimization
• New quasi-Newton methods for unconstrained optimization problems
• Barzilai-Borwein-like methods for the extreme eigenvalue problem
• On the Global Convergence of the BFGS Method for Nonconvex Unconstrained Optimization Problems
• Feasible Barzilai–Borwein-like methods for extreme symmetric eigenvalue problems
• The university of Florida sparse matrix collection
• Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems
• A globally convergent BFGS method for nonconvex minimization without line searches
• Performance and Accuracy of LAPACK's Symmetric Tridiagonal Eigensolvers
• Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
• Unconstrained Variational Principles for Eigenvalues of Real Symmetric Matrices
• A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
• Updating Quasi-Newton Matrices with Limited Storage
• A Trace Minimization Algorithm for the Generalized Eigenvalue Problem
• Jacobi’s Method is More Accurate than QR
• CUTE
• Templates for the Solution of Algebraic Eigenvalue Problems
• Convergence Properties of the BFGS Algoritm
• Convergence of the Iterates of Descent Methods for Analytic Cost Functions
• A modified BFGS method and its global convergence in nonconvex minimization
• Benchmarking optimization software with performance profiles.
• A survey of quasi-Newton equations and quasi-Newton methods for optimization

This page was built for publication: A limited memory BFGS algorithm for non-convex minimization with applications in matrix largest eigenvalue problem