On diagonally preconditioning the truncated Newton method for super-scale linearly constrained nonlinear prrogramming
type: Item
instance of: scholarly article
title: On diagonally preconditioning the truncated Newton method for super-scale linearly constrained nonlinear prrogramming
zbMATH Open document ID: 0551.90078
DOI: 10.1016/0377-2217(84)90136-X
published in: European Journal of Operational Research
publication date: 1984-01-01T00:00:00Z
review text: First, the author presents the basic ideas and algorithms of the truncated and of the preconditioning truncated Newton methods for the problem min f(x); \(x\in {\mathbb{R}}^ n\). Further, these methods are applied to linearly constrained nonlinear programming problems. The corresponding algorithms are precisely described and some useful comments, recommendations and computational results are given, concerning the deactivating strategies, preconditioning procedures, stopping tests, storage and time-consumption.
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 49M37
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 49M15
zbMATH DE Number: 3878694
zbMATH Keywords: preconditioning truncated Newton methods
zbMATH Keywords: linearly constrained nonlinear programming
zbMATH Keywords: computational results
author: Laureano F. Escudero Bueno
MaRDI profile type: Publication
cites work: Q3337236
cites work: Truncated-Newton algorithms for large-scale unconstrained optimization
cites work: Inexact Newton Methods
cites work: Quasi-Newton Methods, Motivation and Theory
cites work: On QR factorization updatings
cites work: Q4739659
cites work: An effective algorithm for minimization
cites work: Methods of conjugate gradients for solving linear systems
cites work: Large-scale linearly constrained optimization
cites work: Conjugate direction methods with variable storage
cites work: Conjugate gradient methods for linearly constrained nonlinear programming
cites work: Matrix conditioning and nonlinear optimization
cites work: Convergence Conditions for Ascent Methods
Recommended article: Efficient tridiagonal preconditioner for the matrix-free truncated Newton method
Recommended article: Preconditioning of Truncated-Newton Methods
Recommended article: Dynamic scaling based preconditioning for truncated Newton methods in large scale unconstrained optimization
Recommended article: Preconditioning Newton-Krylov methods in nonconvex large scale optimization
Recommended article: Generalized tridiagonal preconditioners for solving linear systems
Recommended article: Q4655141
Recommended article: Q3456419
Recommended article: Superlinear Preconditioners for Finite Differences Linear Systems
Recommended article: A diagonal preconditioner for singularly perturbed problems
Recommended article: Nonlinearly Preconditioned Inexact Newton Algorithms
description: scientific article; zbMATH DE number 3878694