A heuristic algorithm for nonlinear programming (Q1093535)
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 4023027
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A heuristic algorithm for nonlinear programming |
scientific article; zbMATH DE number 4023027 |
Statements
A heuristic algorithm for nonlinear programming (English)
0 references
1988
0 references
A heuristic algorithm for nonlinear programming is presented. The algorithm uses two search directions, and the Hessian of the Lagrangian function is approximated with the BFGS secant update. We show that the sequence of iterates converge q-superlinearly if the sequence of approximating matrices satisfies a particular condition. Numerical results are presented.
0 references
constrained minimization
0 references
quasi-Newton methods
0 references
secant methods
0 references
heuristic
0 references
0 references
0 references
0.93650854
0 references
0.92377716
0 references
0.92247635
0 references
0.9136362
0 references
0.9119872
0 references
0.91131663
0 references
0.91131663
0 references
0.9108727
0 references
