A limited-memory optimization method using the infinitely many times repeated BNS update and conjugate directions
type: Item
instance of: scholarly article
title: A limited-memory optimization method using the infinitely many times repeated BNS update and conjugate directions
zbMATH Open document ID: 1440.65064
author: Jan Vlček
author: Ladislav Lukšan
published in: Journal of Computational and Applied Mathematics
publication date: 2019-01-29T00:00:00Z
review text: A new limited-memory variable metric method for large-scale unconstrained optimization is proposed. After a brief description of the L-BFGS and BNS methods, the authors derive and describe the properties of the BNS matrix update for the limited-memory variable metric BNS method for minimization of general functions. This update can be efficiently repeated infinitely many times under some conditions and without a noticeable increase of the number of arithmetic operations. The resulting limit update is a block BFGS update described in [\textit{J. Vlček} and \textit{L. Lukšan}, Numer. Algorithms 80, No. 3, 957--987 (2019; Zbl 1440.90076)], is more efficient than the L-BFGS update, and can be obtained by solving of a suitable Lyapunov matrix equation. The order of this equation can be decreased by combination with methods based on vector corrections for conjugacy. An efficient method for solving the corresponding low-order Lyapunov equations numerically is also proposed. Global convergence of the presented algorithm is established for convex and sufficiently smooth functions. The efficiency of the algorithm is reported using extensive numerical experiments performed on three collections of test problems. These experiments also indicate that the new approach can improve unconstrained large-scale minimization results significantly compared with the frequently used L-BFGS method. The paper is quite technical. Only the reader having some experience in the field and being familiar with the BFGS and BNS methods will understand the paper well.
reviewed by: Ctirad Matonoha
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C06
zbMATH DE Number: 7007554
zbMATH Keywords: unconstrained optimization
zbMATH Keywords: large-scale problems
zbMATH Keywords: limited-memory variable metric method
zbMATH Keywords: BNS method
zbMATH Keywords: repeated BNS update
zbMATH Keywords: Lyapunov matrix equation
zbMATH Keywords: vector corrections
zbMATH Keywords: conjugate directions
zbMATH Keywords: global convergence
zbMATH Keywords: algorithms
zbMATH Keywords: numerical experiments
describes a project that uses: L-BFGS
describes a project that uses: CUTEr
describes a project that uses: LSA
describes a project that uses: CUTE
describes a project that uses: UFO
MaRDI profile type: Publication
full work available at URL: j.cam.2018.10.054
OpenAlex ID: W2900907955
cites work: Representations of quasi-Newton matrices and their use in limited memory methods
cites work: Numerical Optimization
cites work: On the limited memory BFGS method for large scale optimization
cites work: Updating Quasi-Newton Matrices with Limited Storage
cites work: Algorithm 896
cites work: A modified limited-memory BNS method for unconstrained minimization based on the conjugate directions idea
cites work: A conjugate directions approach to improve the limited-memory BFGS method
cites work: Improved Hessian approximations for the limited memory BFGS method
cites work: Extra-updates criterion for the limited memory BFGS algorithm for large scale nonlinear optimization
cites work: Q4226179
cites work: Variable metric methods for unconstrained optimization and nonlinear least squares
cites work: Lyapunov matrix equations in system stability and control.
cites work: Q3393934
cites work: A constructive method for the solution of the stability problem
cites work: A modified BFGS method and its global convergence in nonconvex minimization
cites work: The global convergence of a modified BFGS method for nonconvex functions
cites work: On Lagrange multipliers of trust-region subproblems
cites work: CUTE
cites work: Q3539529
cites work: Benchmarking optimization software with performance profiles.
Wikidata QID: Q128958938
DOI: 10.1016/J.CAM.2018.10.054
description: scientific article; zbMATH DE number 7007554