Indefinitely preconditioned inexact Newton method for large sparse equality constrained non-linear programming problems
- 1 May 1998
- journal article
- research article
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 5 (3) , 219-247
- https://doi.org/10.1002/(sici)1099-1506(199805/06)5:3<219::aid-nla134>3.0.co;2-7
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Preconditioning Mixed Finite Element Saddle-point Elliptic ProblemsNumerical Linear Algebra with Applications, 1996
- Preconditioning Reduced MatricesSIAM Journal on Matrix Analysis and Applications, 1996
- Iterative solution techniques for the stokes and Navier‐Stokes equationsInternational Journal for Numerical Methods in Fluids, 1994
- On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problemMathematical Programming, 1985
- Inexact Newton MethodsSIAM Journal on Numerical Analysis, 1982
- Direct Solution of Sets of Linear Equations whose Matrix is Sparse, Symmetric and IndefiniteIMA Journal of Applied Mathematics, 1979
- Preconditioning of Indefinite Problems by RegularizationSIAM Journal on Numerical Analysis, 1979
- Newton-type methods for unconstrained and linearly constrained optimizationMathematical Programming, 1974
- On the Estimation of Sparse Jacobian MatricesIMA Journal of Applied Mathematics, 1974