Interior point filter method for semi-infinite programming problems

Optimization

Volumn 60, Issue 10-11, 2011, Pages 1309-1338

  Pereira, Ana I ^a   Costa, M Fernanda P ^b   Fernandes, Edite M G P ^b  

^a INSTITUTO POLITÉCNICO DE BRAGANÇA   (Portugal)

^b UNIVERSITY OF MINHO   (Portugal)

Author keywords

filter method; interior point; line search; nonlinear optimization; semi infinite programming

Indexed keywords

EID: 84858173231     PISSN: 02331934     EISSN: 10294945     Source Type: Journal    
DOI: 10.1080/02331934.2011.616894     Document Type: Article

References (43)

1. Ben-Tal, A, Teboule, M and Zowe, J. 1979. Second order necessary optimality conditions for semi-infinite programming problems. Lecture Notes Control Inform. Sci., 15: 17-30.
2. Coope, ID and Watson, GA. 1985. A projected Lagrangian algorithm for semi-infinite programming. Math. Progr., 32: 337-356.
3. Costa, MFP and Fernandes, EMGP. 2008. Practical implementation of an interior point nonmonotone line search filter method. Int. J. Comput. Math., 85: 397-409.
4. M.F.P. Costa and E.M.G.P. Fernandes, A three-D filter line search method within an interior point framework, Proceedings of 2008 International Computational and Mathematical Methods in Science and Engineering, Salamanca, Spain, ISBN: 978-84-612-1982-7, 2008,pp. 173-187
5. El-Bakry, AS, Tapia, RA, Tsuchiya, T and Zhang, Y. 1996. On the formulation and theory of the Newton interior-point method for nonlinear programming. J. Optim. Theory Appl., 89: 507-541.
6. Fletcher, R and Leyffer, S. 2002. Nonlinear programming without a penalty function. Math. Progr., 91: 239-269.
7. Goberna, MA and López, M.A. (Eds.). 2001. Semi-Infinite Programming. Recent Advances, Nonconvex Optimization and Its Applications, Vol. 57, Dordrecht, The Netherlands: Springer-Verlag, Kluwer Academics Publishers.
8. Gramlich, G, Hettich, R and Sachs, EW. 1995. Local convergence of SQP methods in semi-infinite programming. SIAM J. Optim., 5: 641-658.
9. Hettich, R and Jongen, H.Th. 1978. "Semi-infinite programming: Conditions of optimality and applications". In Lectures Notes in Control and Information Science - Optimization Techniques, Edited by: Stoer, J. Vol. 7, 1-11. Berlin: Springer-Verlag.
10. Hettich, R and Kortanek, KO. 1993. Semi-infinite programming: Theory, methods and applications. SIAM Rev., 35: 380-429.
11. Ingber, L. 1989. Very fast simulated re-annealing. Math. Comput. Model., 12: 967-973.
12. Li, D-H, Qi, L, Tam, J and Wu, S-Y. 2004. A smoothing Newton method for semi-infinite programming. J. Global Optim., 30: 169-194.
13. Ling, C, Ni, Q, Qi, L and Wu, S-Y. 2010. A new smoothing Newton-type algorithm for semi-infinite programming. J. Global Optim., 47: 133-159.
14. Liu, G-X. 2007. A homotopy interior point method for semi-infinite programming problems. J. Global Optim., 37: 631-646.
15. López, M and Still, G. 2007. Semi-infinite programming. Eur. J. Oper. Res., 180: 491-518.
16. Nocedal, J and Wright, SJ. 1999. Numerical Optimization, New York: Springer-Verlag.
17. Parsopoulos, K, Plagianakos, V, Magoulas, G and Vrahatis, M. 2001. Objective function stretching to alleviate convergence to local minima. Nonlinear Anal., 47: 3419-3424.
18. A.I. Pereira and E.M.G.P. Fernandes, On a reduction line search filter method for nonlinear semi-infinite programming problems, in Euro Mini Conference on Continuous Optimization and Knowledge-Based Technologies, L. Sakalauskas, G.W. Weber, and E.K. Zavadskas, eds., Neringa, Lithuania, 2008,pp. 174-179
19. A.I. Pereira and E.M.G.P. Fernandes, An hyperbolic penalty filter method for semi-infinite programming, in Numerical Analysis and Applied Mathematics, Vol. 1048, T.E. Simos, G. Psihoyios, and Ch. Tsitouras, eds., AIP Conference Proceedings, Springer-Verlag, Kos, Greece, 2008,pp. 269-273
20. 2-exponential merit function for semi-infinite programming, in International Electronic Conference on Computer Science, Vol. 1060, T.E. Simos and G. Psihoyios, eds., AIP Conference Proceedings, Springer-Verlag, 2008, pp. 11-14. Available at: http://link.aip.org/link/?APC/1060/11/1
21. Pereira, AI and Fernandes, EMGP. 2009. A reduction method for semi-infinite programming by means of a global stochastic approach. Optimization, 58: 713-726.
22. Price, CJ and Coope, ID. 1996. Numerical experiments in semi-infinite programming. Comput. Optim. Appl., 6: 169-189.
23. Qi, L, Ling, C, Tong, X and Zhou, G. 2009. A smoothing projected Newton-type algorithm for semi-infinite programming. Comput. Optim. Appl., 42: 1-30.
24. Qi, L, Wu, WS-Y and Zhou, G. 2003. Semismooth Newton methods for solving semi-infinite programming problems. J. Global Optim., 27: 215-232.
25. Reemtsen, R and Rückmann, J-J. 1998. Semi-infinite Programming, Nonconvex Optimization and Its Applications, Vol. 25, Boston: Kluwer Academic Publishers.
26. Shanno, DF and Vanderbei, RJ. 2000. Interior-point methods for nonconvex nonlinear programming: Orderings and higher-order methods. Math. Program. Ser. B, 87: 303-316.
27. R. Silva, M. Ulbrich, S. Ulbrich, and L.N. Vicente, A globally convergent primal-dual interior-point filter method for nonlinear programming: New filter optimality measures and computational results, Preprint 08-49, Department of Mathematics, U. Coimbra, 2008
28. Stein, O and Still, G. 2003. Solving semi-infinite optimization problems with interior point techniques. SIAM J. Contr. Optim., 42: 769-788.
29. Stein, O and Tezel, A. 2008. The semismooth approach for semi-infinite programming under the reduction ansatz. J. Global Optim., 41: 245-266.
30. Stein, O and Tezel, A. 2009. The semismooth approach for semi-infinite programming without strict complementarity. SIAM J. Optim., 20: 1052-1072.
31. Stein, O and Winterfeld, A. 2010. Feasible method for generalized semi-infinite programming. J. Optim. Theory Appl., 146: 419-443.
32. Still, G. 1999. Generalized semi-infinite programming: Theory and methods. Eur. J. Oper. Res., 119: 301-313.
33. Tanaka, Y, Fukushima, M and Ibaraki, T. 1988. A comparative study of several semi-infinite nonlinear programmnig algorithms. Eur. J. Oper. Res., 36: 92-100.
34. Ulbrich, M, Ulbrich, S and Vicente, LN. 2004. A globally convergent primal-dual interior-point filter method for nonlinear programming. Math. Program., 100: 379-410.
35. Vanderbei, RJ and Shanno, DF. 1999. An interior-point algorithm for nonconvex nonlinear programming. Comput. Optim. Appl., 13: 231-252.
36. Vaz, AIF, Fernandes, EMGP and Gomes, MPSF. 2004. Robot trajectory planning with semi-infinite programming. Eur. J. Oper. Res., 153: 607-617.
37. Vaz, AIF and Ferreira, EC. 2009. Air pollution control with semi-infinite programming. Appl. Math. Model., 33: 1957-1969.
38. Vázquez, FG, Rückmann, J-J, Stein, O and Still, G. 2008. Generalized semi-infinite programming: A tutorial. J. Comput. Appl. Math., 217: 394-419.
39. Wächter, A and Biegler, LT. 2005. Line search filter methods for nonlinear programming: Motivation and global convergence. SIAM J. Optim., 16: 1-31.
40. Wächter, A and Biegler, LT. 2005. Line search filter methods for nonlinear programming: Local convergence. SIAM J. Optim., 16: 32-48.
41. Wächter, A and Biegler, LT. 2006. On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program., 106: 25-57.
42. Weber, G-W and Tezel, A. 2007. On generalized semi-infinite optimization of genetic network. TOP, 15: 65-77.
43. Yi-gui, O. 2009. A filter trust region method for solving semi-infinite programming problems. J. Appl. Math. Comput., 29: 311-324.