Journal
SIAM JOURNAL ON OPTIMIZATION
Volume 22, Issue 3, Pages 772-794Publisher
SIAM PUBLICATIONS
DOI: 10.1137/110844362
Keywords
nonlinear programming; linear constraint programming; Robinson's method; spectral gradient method; filter
Categories
Ask authors/readers for more resources
A new method for nonlinear programming (NLP) using sequential linear constraint programming (SLCP) is described. Linear constraint programming (LCP) subproblems are solved by a new code using a recently developed spectral gradient method for minimization. The method requires only first derivatives and avoids having to store and update approximate Hessian or reduced Hessian matrices. Globalization is provided by a trust region filter scheme. Open source production quality software is available. Results on a large selection of CUTEr test problems are presented and discussed and show that the method is reliable and reasonably efficient.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available