Truncated partitioning group correction algorithms for large-scale sparse unconstrained optimi\-zation

DOI10.1016/j.amc.2007.01.023zbMath1125.65051OpenAlexW2050896598MaRDI QIDQ2383749

Bo Yu, Jun-Xiang Li

Publication date: 19 September 2007

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

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

zbMATH Keywords

unconstrained optimizationcomparison of methodsnumerical examplesconjugate gradient algorithmstruncated Newton-like methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (2)

Inexact smoothing method for large scale minimax optimization ⋮ Inexact trust region PGC method for large sparse unconstrained optimization

Uses Software

• LANCELOT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partitioning group correction Cholesky techniques for large scale sparse unconstrained optimization
• On the convergence of partitioning group correction algorithms
• Successive column correction algorithms for solving sparse nonlinear systems of equations
• Superlinearly convergent algorithm for min-max problems
• Truncated-Newton algorithms for large-scale unconstrained optimization
• On the Estimation of Sparse Hessian Matrices
• Inexact Newton Methods
• Quasi-Newton Methods, Motivation and Theory
• On Sparse and Symmetric Matrix Updating Subject to a Linear Equation
• An Optimal Positive Definite Update for Sparse Hessian Matrices

This page was built for publication: Truncated partitioning group correction algorithms for large-scale sparse unconstrained optimi\-zation