On the convergence of partitioning group correction algorithms

DOI10.1016/j.amc.2006.07.107zbMath1171.65047OpenAlexW2062022148MaRDI QIDQ876605

N. E. Zubov

Publication date: 26 April 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.07.107

zbMATH Keywords

partitionnumerical resultsHessiansuperlinear convergencesparsityCholeskycorrection algorithmscale sparse unconstrained optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)

Related Items (4)

Truncated partitioning group correction algorithms for large-scale sparse unconstrained optimi\-zation ⋮ Inexact smoothing method for large scale minimax optimization ⋮ Inexact trust region PGC method for large sparse unconstrained optimization ⋮ Group update method for sparse minimax problems

Uses Software

• minpack

Cites Work

• Partitioning group correction Cholesky techniques for large scale sparse unconstrained optimization
• Successive column correction algorithms for solving sparse nonlinear systems of equations
• The substitution secant/finite difference method for large scale sparse unconstrained optimization
• Estimation of sparse hessian matrices and graph coloring problems
• On the Estimation of Sparse Hessian Matrices
• Testing Unconstrained Optimization Software
• On Sparse and Symmetric Matrix Updating Subject to a Linear Equation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the convergence of partitioning group correction algorithms