Computational experience with a safeguarded barrier algorithm for sparse nonlinear programming (Q5939946): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 00:43, 5 March 2024
scientific article; zbMATH DE number 1623509
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational experience with a safeguarded barrier algorithm for sparse nonlinear programming |
scientific article; zbMATH DE number 1623509 |
Statements
Computational experience with a safeguarded barrier algorithm for sparse nonlinear programming (English)
0 references
10 February 2002
0 references
The authors propose an enhanced version of the primal-dual interior point algorithm presented by \textit{L. S. Lasdon, J. Plummer} and \textit{G. Yu} [ORSA J. Comput. 7, No. 3, 321-332 (1995; Zbl 0859.90111)] for solving large sparse nonlinear programming problems which may not be convex. Some computational results are presented on both small and large models.
0 references
nonlinear programming
0 references
barrier algorithm
0 references
large sparse problems
0 references
computational experience
0 references
numerical examples
0 references
primal-dual interior point algorithm
0 references
