Presentación | Participantes | Bibliografía (DML-E) | Bibliografía adicional | Enlaces de interés | Otros proyectos DML | Ayuda  
INICIO | 28 de marzo de 2024
  

On diagonally-preconditioning the truncated-Newton method for super-scale linearly constrained nonlinear programming.

Título inglés On diagonally-preconditioning the truncated-Newton method for super-scale linearly constrained nonlinear programming.
Título español Precondicionamiento diagonal del método de Newton truncado para programación no lineal restringida linealmente en súper escala.
Autor/es Escudero, Laureano F.
Organización Cent. Invest. UAM-IBM, Madrid, España
Revista 0210-8054
Publicación 1982, 6 (3): 261-281, 31 Ref.
Tipo de documento articulo
Idioma Inglés
Resumen inglés 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.
Clasificación UNESCO 120711
Palabras clave español Programación no lineal ; Conjuntos convexos ; Método de Newton
Icono pdf Acceso al artículo completo
Equipo DML-E
Instituto de Ciencias Matemáticas (ICMAT - CSIC)
rmm()icmat.es