Partitioning group correction Cholesky techniques for large scale sparse unconstrained optimization

DOI10.1016/J.AMC.2006.05.001MaRDI QIDQ858748zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 3913560 (Why is no real title available?)
• scientific article; zbMATH DE number 53680 (Why is no real title available?)
• scientific article; zbMATH DE number 3529352 (Why is no real title available?)
• scientific article; zbMATH DE number 404706 (Why is no real title available?)
• scientific article; zbMATH DE number 640536 (Why is no real title available?)
• scientific article; zbMATH DE number 1014688 (Why is no real title available?)
• scientific article; zbMATH DE number 1131713 (Why is no real title available?)
• scientific article; zbMATH DE number 852532 (Why is no real title available?)
• scientific article; zbMATH DE number 3430031 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• A class of factorization update algorithm for solving systems of sparse nonlinear equations
• An Optimal Positive Definite Update for Sparse Hessian Matrices
• Estimation of sparse hessian matrices and graph coloring problems
• On Sparse and Symmetric Matrix Updating Subject to a Linear Equation
• On the Estimation of Sparse Hessian Matrices
• Quasi-Newton Methods, Motivation and Theory
• Some Numerical Results Using a Sparse Matrix Updating Formula in Unconstrained Optimization
• Successive column correction algorithms for solving sparse nonlinear systems of equations
• Testing Unconstrained Optimization Software
• The substitution secant/finite difference method for large scale sparse unconstrained optimization

Cited in

(6)

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

Describes a project that uses

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)