Inexact trust region PGC method for large sparse unconstrained optimization

DOI10.1007/s10589-010-9381-zzbMath1244.90222OpenAlexW2012175268MaRDI QIDQ429517

Jiazhen Huo, Limei Yan, Shudong Li, Jun-Xiang Li

Publication date: 19 June 2012

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-010-9381-z

zbMATH Keywords

partitionunconstrained optimizationinexactnegative curvaturesparsitylocally constrained steps

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

Substitution secant/finite difference method to large sparse minimax problems

Uses Software

• Mathematica
• GQTPAR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the convergence of partitioning group correction algorithms
• Two new unconstrained optimization algorithms which use function and gradient values
• Successive element correction algorithms for sparse unconstrained optimization
• Truncated partitioning group correction algorithms for large-scale sparse unconstrained optimi\-zation
• A trust region-CG algorithm for deblurring problem in atmospheric image reconstruction
• A new trust region algorithm for image restoration
• Truncated-Newton algorithms for large-scale unconstrained optimization
• Computing a Trust Region Step
• The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
• Estimation of sparse hessian matrices and graph coloring problems
• On the Estimation of Sparse Hessian Matrices
• Inexact Newton Methods
• Numerical Optimization
• On the Successive Projections Approach to Least-Squares Problems
• A New Algorithm for Unconstrained Optimization