Sparse quasi-Newton updates with positive definite matrix completion
type: Item
instance of: scholarly article
title: Sparse quasi-Newton updates with positive definite matrix completion
zbMATH Open document ID: 1151.90059
author: Nobuo Yamashita
published in: Mathematical Programming. Series A. Series B
publication date: 2008-06-30T00:00:00Z
Mathematics Subject Classification ID: 90C53
Mathematics Subject Classification ID: 90C06
zbMATH DE Number: 5294506
zbMATH Keywords: unconstrained optimization
zbMATH Keywords: quasi-Newton method
zbMATH Keywords: large-scale problems
zbMATH Keywords: sparsity
zbMATH Keywords: positive definite matrix completion
describes a project that uses: CUTEr
describes a project that uses: L-BFGS
describes a project that uses: symrcm
describes a project that uses: LANCELOT
describes a project that uses: ve08
MaRDI profile type: Publication
full work available at URL: s10107-007-0137-1
OpenAlex ID: W2038309122
cites work: Q4288578
cites work: Q3707252
cites work: Q4023146
cites work: A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
cites work: Q3702408
cites work: A New Variational Result for Quasi-Newton Formulae
cites work: An Optimal Positive Definite Update for Sparse Hessian Matrices
cites work: Exploiting sparsity in semidefinite programming via matrix completion. I: General framework
cites work: Q3664299
cites work: CUTEr and SifDec
cites work: Q3677522
cites work: Partitioned variable metric updates for large structured optimization problems
cites work: On the existence of convex decompositions of partially separable functions
cites work: Positive definite completions of partial Hermitian matrices
cites work: On the limited memory BFGS method for large scale optimization
cites work: Updating Quasi-Newton Matrices with Limited Storage
cites work: Numerical Optimization
cites work: On the Estimation of Sparse Hessian Matrices
cites work: The Shanno-Toint Procedure for Updating Sparse Symmetric Matrices
cites work: Forcing sparsity by projecting with respect to a non-diagonally weighted frobenius norm
cites work: Collinear scaling and sequential estimation in sparse optimization algorithms
cites work: On Sparse and Symmetric Matrix Updating Subject to a Linear Equation
DOI: 10.1007/S10107-007-0137-1
Recommended article: Analysis of sparse quasi-Newton updates with positive definite matrix completion
Recommended article: Convergence analysis of sparse quasi-Newton updates with positive definite matrix completion for two-dimensional functions
Recommended article: An Optimal Positive Definite Update for Sparse Hessian Matrices
Recommended article: Sparse quasi-Newton LDU updates
Recommended article: Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
Recommended article: A coordinate descent algorithm for sparse positive definite matrix estimation
Recommended article: A New Sparsity Preserving Quasi-Newton Update for Solving Nonlinear Equations
Recommended article: A hybrid quasi-Newton method with application in sparse recovery
Recommended article: A new algorithm for positive semidefinite matrix completion
description: scientific article; zbMATH DE number 5294506