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

DOI10.1016/0377-2217(84)90136-XzbMath0551.90078MaRDI QIDQ800833

Laureano Fernando Escudero Bueno

Publication date: 1984

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

computational resultslinearly constrained nonlinear programmingpreconditioning truncated Newton methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Newton-type methods (49M15) Numerical methods based on nonlinear programming (49M37)

Related Items (4)

A Hessian-free Newton-Raphson method for the configuration of physics systems featured by numerically asymmetric force field ⋮ On optimizing a maximin nonlinear function subject to replicated quasi- arborescence-like constraints ⋮ On diagonally-preconditioning the 2-step BFGS method with accumulated steps for linearly constrained nonlinear programming ⋮ Performance evaluation of independent superbasic sets on nonlinear replicated networks

Cites Work

• Unnamed Item
• Unnamed Item
• An effective algorithm for minimization
• Truncated-Newton algorithms for large-scale unconstrained optimization
• On QR factorization updatings
• Conjugate gradient methods for linearly constrained nonlinear programming
• Inexact Newton Methods
• Conjugate direction methods with variable storage
• Quasi-Newton Methods, Motivation and Theory
• Matrix conditioning and nonlinear optimization
• Large-scale linearly constrained optimization
• Convergence Conditions for Ascent Methods
• Methods of conjugate gradients for solving linear systems

This page was built for publication: On diagonally preconditioning the truncated Newton method for super-scale linearly constrained nonlinear prrogramming