Partitioning group correction Cholesky techniques for large scale sparse unconstrained optimization

DOI10.1016/J.AMC.2006.05.001zbMATH Open1111.65053OpenAlexW2091303894MaRDI QIDQ858748FDOQ858748

Authors: 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

Recommendations

• Truncated partitioning group correction algorithms for large-scale sparse unconstrained optimi\-zation
• On the convergence of partitioning group correction algorithms
• A method with partitioning column updates of Cholesky factorization for large scale sparse unconstrained optimization
• Modified Cholesky Factorizations for Sparse Preconditioners
• Inexact trust region PGC method for large sparse unconstrained optimization

zbMATH Keywords

numerical examplessuperlinear convergencecomparison of methodsCholesky 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)

Cites Work

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

Cited In (6)

• On the convergence of partitioning group correction algorithms
• A method with partitioning column updates of Cholesky factorization for large scale sparse unconstrained optimization
• Truncated partitioning group correction algorithms for large-scale sparse unconstrained optimi\-zation
• Group update method for sparse minimax problems
• Inexact smoothing method for large scale minimax optimization
• Inexact trust region PGC method for large sparse unconstrained optimization

Uses Software

• LANCELOT
• minpack

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q858748)