We present an algorithm for super-scale linearly constrained nonlinear programming (LCNP) based on Newton's method. In large scale programming solving Newton's equation at each iteration can be expensive and may not be justified when far from a local solution; we briefly review the current existing methodologies, such that by classifying the problems in small-scale, super-scale and supra-scale problems we suggest the methods that, based on our own computational experience, are more suitable in each case for coping with the problem of solving Newton's equation. For super-scale problems, the Truncated-Newton method (where an inaccurate solution is computed by using the conjugate-gradient method) is recommended; a diagonal BFGS preconditioning of the gradient is used, so that the number of iterations to solve the equation is reduced. The procedure for updating that preconditioning is described for LCNP when the set of active constraints or the partition of basic, superbasic and non-basic (structural) variables have been changed.
@article{urn:eudml:doc:39999,
title = {On diagonally-preconditioning the truncated-Newton method for super-scale linearly constrained nonlinear programming.},
journal = {Q\"uestii\'o},
volume = {6},
year = {1982},
pages = {261-281},
language = {en},
url = {http://dml.mathdoc.fr/item/urn:eudml:doc:39999}
}
Escudero, Laureano F. On diagonally-preconditioning the truncated-Newton method for super-scale linearly constrained nonlinear programming.. Qüestiió, Tome 6 (1982) pp. 261-281. http://gdmltest.u-ga.fr/item/urn:eudml:doc:39999/