The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. II. An efficient implementation with linear least squares subproblems (Q790581)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3848510
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. II. An efficient implementation with linear least squares subproblems |
scientific article; zbMATH DE number 3848510 |
Statements
The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. II. An efficient implementation with linear least squares subproblems (English)
0 references
1981
0 references
[For part I see ibid. 38, 83-114 (1981; reviewed above).] This paper presents the results of numerical experiments for different versions of the method of R. B. Wilson, S.-P. Han and M. J. D. Powell. The following topics are studied and tested: the influence of the line search function on the numerical performance, the effect of a least square formulation of the quadratic subproblem, the dependence of the performance from different solution methods for the least squares subproblem, the usage of numerical differentiation, and the effect of an inverse update technique.
0 references
numerical experiments
0 references
line search function
0 references
numerical performance
0 references
least square formulation
0 references
quadratic subproblem
0 references
inverse update technique
0 references
0 references
0.884482741355896
0 references
0.7939467430114746
0 references
0.793883204460144
0 references
0.7915266156196594
0 references
