A quadratic programming algorithm for large and sparse problems
Miroslav Tůma (1991)
Kybernetika
Similarity:
Miroslav Tůma (1991)
Kybernetika
Similarity:
Luis Fernandes, Isabel Figueiredo, Joaquim Júdice (2002)
International Journal of Applied Mathematics and Computer Science
Similarity:
In this paper the solution of a finite element approximation of a linear obstacle plate problem is investigated. A simple version of an interior point method and a block pivoting algorithm have been proposed for the solution of this problem. Special purpose implementations of these procedures are included and have been used in the solution of a set of test problems. The results of these experiences indicate that these procedures are quite efficient to deal with these instances and compare...
Laureano F. Escudero (1982)
Qüestiió
Similarity:
We present an algorithm for supra-scale linearly constrained nonlinear programming (LNCP) based on the Limited-Storage Quasi-Newton's method. In large-scale programming solving the reduced Newton equation at each iteration can be expensive and may not be justified when far from a local solution; besides, the amount of storage required by the reduced Hessian matrix, and even the computing time for its Quasi-Newton approximation, may be prohibitive. An alternative based on the reduced...
Weigandt, Anna, Tuthill, Kaitlyn, Jibrin, Shafiu (2010)
Journal of Applied Mathematics
Similarity:
Ladislav Lukšan (1996)
Kybernetika
Similarity: