Convergence analysis of sparse quasi-Newton updates with positive definite matrix completion for two-dimensional functions
Authors:
- Yuhong DaiYDYuhong Dai
- Nobuo YamashitaNYNobuo Yamashita
Open Access
- 1 January 2011
- journal article
- Published by American Institute of Mathematical Sciences (AIMS) in Numerical Algebra, Control & Optimization
- Vol. 1 (1) , 61-69
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- The BFGS method with exact line searches fails for non-convex objective functionsMathematical Programming, 2004
- Convergence Properties of the BFGS AlgoritmSIAM Journal on Optimization, 2002
- A modified BFGS method and its global convergence in nonconvex minimizationJournal of Computational and Applied Mathematics, 2001
- On the Global Convergence of the BFGS Method for Nonconvex Unconstrained Optimization ProblemsSIAM Journal on Optimization, 2001
- Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General FrameworkSIAM Journal on Optimization, 2001
- An Optimal Positive Definite Update for Sparse Hessian MatricesSIAM Journal on Optimization, 1995
- On the limited memory BFGS method for large scale optimizationMathematical Programming, 1989
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained MinimizationSIAM Journal on Numerical Analysis, 1989
- Global Convergence of a Cass of Quasi-Newton Methods on Convex ProblemsSIAM Journal on Numerical Analysis, 1987
- Quasi-Newton Methods, Motivation and TheorySIAM Review, 1977