A primal-dual interior point method for nonlinear optimization: Global convergence, convergence rate and numerical performance for large scale problems (Q2722337)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A primal-dual interior point method for nonlinear optimization: Global convergence, convergence rate and numerical performance for large scale problems |
scientific article; zbMATH DE number 1617670
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A primal-dual interior point method for nonlinear optimization: Global convergence, convergence rate and numerical performance for large scale problems |
scientific article; zbMATH DE number 1617670 |
Statements
12 July 2001
0 references
survey
0 references
primal-dual interior point algorithms
0 references
nonlinear optimization problems
0 references
superlinear convergence
0 references
global convergence
0 references
A primal-dual interior point method for nonlinear optimization: Global convergence, convergence rate and numerical performance for large scale problems (English)
0 references
This paper contains a survey of primal-dual interior point algorithms for general nonlinear optimization problems, using Newton-like iteration and the barrier penalty function. In this context, both methods are shown to be convergent in the global sense. An important example is given in order to show that it is possible to combine the superlinear convergence property and the global convergence property. The experiments considered here show that the methods used by the authors are indeed efficient also for small scale Hoch and Schittkowski problems and for large scale problems.NEWLINENEWLINEFor the entire collection see [Zbl 0958.00047].
0 references