Practical implementation of an interior point nonmonotone line search filter method

International Journal of Computer Mathematics

Volumn 85, Issue 3-4, 2008, Pages 397-409

  Costa, M Fernanda P ^a   Fernandes, Edite M G P ^a  

^a UNIVERSITY OF MINHO   (Portugal)

Author keywords

Filter method; Interior point method; Line search method; Nonlinear programming; Nonmonotone strategy

Indexed keywords

ACCEPTABILITY CRITERION; FILTER METHOD; INTERIOR POINT; INTERIOR POINT METHODS; LINE SEARCH METHOD; NONMONOTONE; NONMONOTONE LINE SEARCH; OPTIMALITY CONDITIONS;

COMPUTER SCIENCE; MATHEMATICAL TECHNIQUES;

NONLINEAR PROGRAMMING;

EID: 41449088424     PISSN: 00207160     EISSN: 10290265     Source Type: Journal    
DOI: 10.1080/00207160701294442     Document Type: Conference Paper

References (17)

1. Fletcher, R. and Leyffer, S., 2002, Nonlinear programming without a penalty function. Mathematical Programming, 91, 239-269.
2. Ulbrich, M., Ulbrich, S. and Vicente, L.N., 2004, A globally convergent primal-dual interior-point filter method for nonlinear programming. Mathematical Programming, 100, 379-410.
3. Benson, H.Y., Vanderbei, R.J. and Shanno, D.F., 2002, Interior-point methods for nonconvex nonlinear programming: filter methods and merit functions. Computational Optimization and Applications, 23, 257-272.
4. Wächter, A. and Biegler, L.T., 2005, Line search filter methods for nonlinear programming: motivation and global convergence. SIAM Journal on Optimization, 16, 1-31.
5. Wächter, A. and Biegler, L.T., 2005, Line search filter methods for nonlinear programming: local convergence. SIAM Journal on Optimization, 16, 32-48.
6. Wächter, A. and Biegler, L.T., 2006, On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Mathematical Programming, 106, 25-57.
7. Grippo, L., Lampariello, F. and Lucidi S., 1986, A nonmonotone line search technique for Newton's method. SIAM Journal on Numerical Analysis, 23, 707-716.
8. Grippo, L., Lampariello, F. and Lucidi S., 1991, A class of nonmonotone stabilization methods in unconstrained optimization. Numerische Mathematik, 59, 779-805.
9. Bonettini, L., 2005, A.nonmonotone inexact Newton method. Optimization Methods and Software, 20, 475-491.
10. Vanderbei, R.J., 1998, LOQO: An interior-code for quadratic programming. Technical report SOR-94-15, Princeton University, Statistics and Operations Research.
11. Fletcher, R., Gould, N.I.M., Leyffer, S., Toint, Ph.L. and Wächter, A., 2002, Global convergence of a trust-region SQP-filter algorithm for general nonlinear programming. SIAM Journal on Optimization, 13, 635-659.
12. Hock, W. and Schittkowski, K., 1981, Test Examples for Nonlinear Programming (Berlin: Springer-Verlag).
13. Vanderbei, RJ. and Shanno, D.F., 1999, An interior-point algorithm for nonconvex nonlinear programming. Computational Optimization and Applications, 13, 231-252.
14. Shanno, D.F. and Vanderbei, R.J., 2000, Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methods. Mathematical Programming B, 87, 303-316.
15. Nocedal, J. and Wright, S.J., 1999, Numerical Optimization (Berlin: Springer-Verlag).
16. Wächter, A. and Biegler, L.T., 2000, Failure of global convergence for a class of interior point methods for nonlinear programming. Mathematical Programming, 88, 565-574.
17. Benson, H.Y., Shanno, D.F and Vanderbei, R.J., 2000, Interior-point methods for nonconvex nonlinear programming : jamming and comparative numerical testing. Technical report ORFE-00-02, Princeton University, Operations Research and Financial Engineering.