Interior-point methods for nonconvex nonlinear programming: jamming and numerical testing (Q1424286)
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 2055180
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Interior-point methods for nonconvex nonlinear programming: jamming and numerical testing |
scientific article; zbMATH DE number 2055180 |
Statements
Interior-point methods for nonconvex nonlinear programming: jamming and numerical testing (English)
0 references
11 March 2004
0 references
The paper considers an example of Wachter and Biegler which is shown to converge to a nonstationary point for the standard primal-dual interior-point method for nonlinear programming. The reason for this failure is analyzed and a heuristic resolution is discussed. The paper characterizes the performance of the test LOQO (a line-search interior-point code) on a large test set of nonlinear programming problems. Specific types of problems which can cause LOQO to fail are identified.
0 references
nonlinear programming
0 references
interior-point methods
0 references
0.8175488710403442
0 references
0.8017688989639282
0 references
0.7972850203514099
0 references
0.7962692975997925
0 references
