Indefinitely preconditioned inexact Newton method for large sparse equality constrained non-linear programming problems
✍ Scribed by Ladislav Lukšan; Jan Vlček
- Publisher
- John Wiley and Sons
- Year
- 1998
- Tongue
- English
- Weight
- 195 KB
- Volume
- 5
- Category
- Article
- ISSN
- 1070-5325
No coin nor oath required. For personal study only.
✦ Synopsis
An inexact Newton algorithm for large sparse equality constrained non-linear programming problems is proposed. This algorithm is based on an indefinitely preconditioned smoothed conjugate gradient method applied to the linear KKT system and uses a simple augmented Lagrangian merit function for Armijo type stepsize selection. Most attention is devoted to the termination of the CG method, guaranteeing sufficient descent in every iteration and decreasing the number of required CG iterations, and especially, to the choice of a suitable preconditioner. We investigate four preconditioners, which have 2 × 2 block structure, and prove theoretically their good properties. The efficiency of the inexact Newton algorithm, together with a comparison of various preconditioners and strategies, is demonstrated by using a large collection of test problems.