Global convergence and implementation of NGTN method for solving large-scale sparse nonlinear programming problems (Q2748451)
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 1659454
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Global convergence and implementation of NGTN method for solving large-scale sparse nonlinear programming problems |
scientific article; zbMATH DE number 1659454 |
Statements
14 October 2001
0 references
negative gradient truncated Newton method
0 references
large-scale sparse nonlinear programming problems
0 references
global convergence
0 references
numerical tests
0 references
Global convergence and implementation of NGTN method for solving large-scale sparse nonlinear programming problems (English)
0 references
The authors present a negative gradient truncated Newton (NGTN) method for solving large-scale sparse nonlinear programming problems. This is a hybrid method of a truncated Newton direction and a modified negative gradient direction. The global convergence of the given method is proved and numerical tests are given.
0 references
0.8266080617904663
0 references
0.8266080617904663
0 references
0.7675681114196777
0 references
