Abstract
The paper considers an example of Wächter 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 then characterizes the performance of 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.
Original language | English (US) |
---|---|
Pages (from-to) | 35-48 |
Number of pages | 14 |
Journal | Mathematical Programming |
Volume | 99 |
Issue number | 1 |
DOIs | |
State | Published - Jan 2004 |
All Science Journal Classification (ASJC) codes
- Software
- General Mathematics
Keywords
- Interior-point methods
- Jamming
- Nonconvex optimization
- Nonlinear programming