A survey of quasi-Newton equations and quasi-Newton methods for optimization
From MaRDI portal
Publication:5959297
DOI10.1023/A:1012959223138zbMath1007.90069OpenAlexW123808961MaRDI QIDQ5959297
Zhang, Jianzhong, Cheng-Xian Xu
Publication date: 26 March 2002
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1012959223138
positive definitenessconvergence propertiesquasi-Newton methodsfinite terminationquasi-Newton equations
Related Items
A limited memory BFGS algorithm for non-convex minimization with applications in matrix largest eigenvalue problem ⋮ Scaling damped limited-memory updates for unconstrained optimization ⋮ Broyden's quasi-Newton methods for a nonlinear system of equations and unconstrained optimization: a review and open problems ⋮ Nonmonotone diagonally scaled limited-memory BFGS methods with application to compressive sensing based on a penalty model ⋮ A compact limited memory method for large scale unconstrained optimization ⋮ A hybrid quasi-Newton method with application in sparse recovery ⋮ Spectral scaling BFGS method ⋮ Quasi-Newton algorithms for solving interval-valued multiobjective optimization problems by using their certain equivalence ⋮ A modified scaled memoryless symmetric rank-one method ⋮ Eigenvalue analyses on the memoryless Davidon-Fletcher-Powell method based on a spectral secant equation ⋮ A NONMONOTONE ADMM-BASED DIAGONAL QUASI-NEWTON UPDATE WITH APPLICATION TO THE COMPRESSIVE SENSING PROBLEM ⋮ A modified scaled memoryless BFGS preconditioned conjugate gradient method for unconstrained optimization ⋮ A combined class of self-scaling and modified quasi-Newton methods ⋮ On the Local and Superlinear Convergence of a Parameterized DFP Method ⋮ A Newton-like trust region method for large-scale unconstrained nonconvex minimization ⋮ Approximation algorithms for MAX RES CUT with limited unbalanced constraints ⋮ A linear hybridization of the Hestenes-Stiefel method and the memoryless BFGS technique ⋮ Two adaptive Dai-Liao nonlinear conjugate gradient methods ⋮ MATRIX ANALYSES ON THE DAI–LIAO CONJUGATE GRADIENT METHOD ⋮ A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems ⋮ A subspace modified Broyden-Fletcher-Goldfarb-Shanno method for \(\mathcal{B} \)-eigenvalues of symmetric tensors ⋮ A CONTINUATION APPROACH USING NCP FUNCTION FOR SOLVING MAX-CUT PROBLEM ⋮ Two hybrid nonlinear conjugate gradient methods based on a modified secant equation ⋮ Diagonally scaled memoryless quasi-Newton methods with application to compressed sensing ⋮ A CLASS OF MODIFIED BFGS METHODS WITH FUNCTION VALUE INFORMATION FOR UNCONSTRAINED OPTIMIZATION
