AUTHORS: Aldina Correia, Joao Matias, Pedro Mestre, Carlos Serodio
Download as PDF
ABSTRACT: Constrained nonlinear optimization problems can be solved using penalty or barrier functions. This strategy, based on solving unconstrained problems obtained form the original problem, has shown to be effective, particularly when used with direct search methods. An alternative to solve the above mentioned problems is the filters method. The filters method, introduced by Fletcher and Leyffer in 2002, has been widely used to solve constrained problems. These methods use a different strategy when compared with penalty or barrier functions. The previous functions define a new one that combine the objective function and the constraints, while the filters method treat optimization problems as bi-objective problems where the objective function and a function that aggregates the constraints are optimized. Based on the work of Audet and Dennis, using filters method with derivative-free algorithms, the authors developed some works where other direct search methods were used, combining their potential with the filters method. More recently, a new variant of these methods was presented, where some alternative aggregation restrictions for the construction of filters were proposed. This paper presents a variant of the filters method, more robust than the previous ones, that has been implemented with a safeguard procedure where values of the function and constraints are linked together and are not treated as completely independently
KEYWORDS: Constrained nonlinear optimization, Filters method, Direct search methods
REFERENCES:
[1] C. Audet and J. Dennis. A pattern search filter method for nonlinear programming without derivatives. SIAM Journal on Optimization, 5(14):980–1010, (2004).
[2] I. Bongartz, A. Conn, N. Gould, and P. Toint. Cute: Constrained and unconstrained testing environment. ACM Transactions and Mathematical Software, (21):123–160, (1995).
[3] A. Correia, J. Matias, P. Mestre, and C. Serodio. ˆ Derivative-free optimization and filter methods to solve nonlinear constrained problems. International Journal of Computer Mathematics, 86(10-11):1841–1851, 2009.
[4] A. Correia, J. Matias, P. Mestre, and C. Serodio. ˆ Filters method in direct search optimization, new measures to admissibility. In Proceedings of the 11th International Conference on Computational and Mathematical Methods in Science and Engineering, volume 1, pages 384– 396. CMMSE-Computational and Mathematical Methods in Science and Engineering, 2011.
[5] A. Correia, J. Matias, P. Mestre, and C. Serodio. ˆ Derivative-free nonlinear optimization filter simplex. International Journal of Applied Mathematics and Computer Science (AMCS), 20(4), (In Press, 2010).
[6] A. Correia, J. Matias, and C. Serodio. ˆ Derivative-free optimization and filter methods for solve nonlinear constrained problems. In Proceedings of the 2008 International Conference on Computational and Mathematical
[7] R. Fletcher. Nonlinear programming without a penalty function. Mathematical Programming, 91:239–269, 1997.
[8] E. W. Karas et al. Exemplos de trajetoria central ´ mal comportada em otimizac¸ao convexa e um al- ˜ goritmo de filtros para programac¸ao n ˜ ao linear. ˜ 2002.
[9] A. Ribeiro, E. Karas, and C. Gonzaga. Global convergence of filter methods for nonlinear programming. SIAM J. on Optimization, 19(3):1231–1249, 2008.
[10] K. Schittkowski. More Test Examples for Nonlinear Programming Codes, Economics and Mathematical Systems. Springer-Verlag, Berlin, (1987).
