On the convergence of partitioning group correction algorithms

DOI10.1016/J.AMC.2006.07.107MaRDI QIDQ876605zbMATH OpenOpenAlexFDO

Authors 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

numerical resultssparsitypartitionHessiansuperlinear convergenceCholeskycorrection algorithmscale sparse unconstrained optimization

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
• Partitioning group correction Cholesky techniques for large scale sparse unconstrained optimization
• Group update method for sparse minimax problems
• The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients
• Successive element correction algorithms for sparse unconstrained optimization

Cites work

• scientific article; zbMATH DE number 3913560 (Why is no real title available?)
• scientific article; zbMATH DE number 3936369 (Why is no real title available?)
• scientific article; zbMATH DE number 1193038 (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 3793774 (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?)
• 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
• Partitioning group correction Cholesky techniques for large scale sparse 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

(5)

• Group update method for sparse minimax problems
• Truncated partitioning group correction algorithms for large-scale sparse unconstrained optimi\-zation
• Partitioning group correction Cholesky techniques for large scale sparse unconstrained optimization
• 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

• minpack

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

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