Partitioning group correction Cholesky techniques for large scale sparse unconstrained optimization

DOI10.1016/j.amc.2006.05.001zbMath1111.65053OpenAlexW2091303894MaRDI QIDQ858748

N. E. Zubov

Publication date: 11 January 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.05.001

zbMATH Keywords

comparison of methodsnumerical examplessuperlinear convergenceCholesky algorithmlarge scale sparse problemssuccessive partitioning group correctionunconstraint minimization

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 ⋮ On the convergence of partitioning group correction algorithms ⋮ Inexact smoothing method for large scale minimax optimization ⋮ Group update method for sparse minimax problems

Uses Software

• LANCELOT
• minpack

Cites Work

• Successive column correction algorithms for solving sparse nonlinear systems of equations
• The substitution secant/finite difference method for large scale sparse unconstrained optimization
• A class of factorization update algorithm for solving systems of sparse nonlinear equations
• Estimation of sparse hessian matrices and graph coloring problems
• On the Estimation of Sparse Hessian Matrices
• Testing Unconstrained Optimization Software
• Quasi-Newton Methods, Motivation and Theory
• On Sparse and Symmetric Matrix Updating Subject to a Linear Equation
• Some Numerical Results Using a Sparse Matrix Updating Formula in Unconstrained Optimization
• An Optimal Positive Definite Update for Sparse Hessian Matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Partitioning group correction Cholesky techniques for large scale sparse unconstrained optimization