On the convergence of partitioning group correction algorithms
type: Item
instance of: scholarly article
title: On the convergence of partitioning group correction algorithms
zbMATH Open document ID: 1171.65047
author: N. E. Zubov
published in: Applied Mathematics and Computation
publication date: 2007-04-26T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C06
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 5147012
zbMATH Keywords: Hessian
zbMATH Keywords: sparsity
zbMATH Keywords: partition
zbMATH Keywords: Cholesky
zbMATH Keywords: correction algorithm
zbMATH Keywords: scale sparse unconstrained optimization
zbMATH Keywords: superlinear convergence
zbMATH Keywords: numerical results
describes a project that uses: minpack
MaRDI profile type: Publication
full work available at URL: j.amc.2006.07.107
OpenAlex ID: W2062022148
cites work: Estimation of sparse hessian matrices and graph coloring problems
cites work: Q3707252
cites work: Q5180766
cites work: Q4868581
cites work: Q3690103
cites work: Q4739659
cites work: Successive column correction algorithms for solving sparse nonlinear systems of equations
cites work: Partitioning group correction Cholesky techniques for large scale sparse unconstrained optimization
cites work: Testing Unconstrained Optimization Software
cites work: Q5652137
cites work: On the Estimation of Sparse Hessian Matrices
cites work: On Sparse and Symmetric Matrix Updating Subject to a Linear Equation
cites work: Q3841634
cites work: Q4338391
cites work: Q4306346
cites work: The substitution secant/finite difference method for large scale sparse unconstrained optimization
DOI: 10.1016/J.AMC.2006.07.107
description: scientific article; zbMATH DE number 5147012