[Audet, C. (2004). Convergence results for pattern search algorithms are tight, Optimization and Engineering 2(5): 101-122.10.1023/B:OPTE.0000033370.66768.a9]Search in Google Scholar
[Audet, C., Bchard, V. and Le Digabel, S. (2008). Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search, Journal of Global Optimization 41(2): 299-318.10.1007/s10898-007-9234-1]Search in Google Scholar
[Audet, C. and Dennis Jr., J. E. (2007). A mads algorithm with a progressive barrier for derivative-free nonlinear programming, Technical Report G-2007-37, GERAD Reports, Polytechnic School of Montreal, Montreal.]Search in Google Scholar
[Audet, C. and Dennis Jr., J. E. (2006). Mesh adaptive direct search algorithms for constrained optimization, SIAM Journal on Optimization (17): 188-217.10.1137/040603371]Search in Google Scholar
[Audet, C. and Dennis Jr., J. (2004). A pattern search filter method for nonlinear programming without derivatives, SIAM Journal on Optimization 5(14): 980-1010.10.1137/S105262340138983X]Search in Google Scholar
[Audet, C. and Dennis Jr., J. E. (2002). Analysis of generalized pattern searches, SIAM Journal on Optimization 13(3): 889-903.10.1137/S1052623400378742]Search in Google Scholar
[Audet, C., Dennis Jr., J. E. and Le Digabel, S. (2008). Globalization strategies for mesh adaptative direct search, Technical Report G-2008-74, GERAD Reports, Polytechnic School of Montreal, Montreal.]Search in Google Scholar
[Bertsekas, D. P. (1999). Nonlinear Programming, Athena Scientific, Belmont, MA.]Search in Google Scholar
[Bongartz, I., Conn, A., Gould, N. and Toint, P. (1995). Cute: Constrained and unconstrained testing environment, ACM Transactions and Mathematical Software 21(1): 123-160.10.1145/200979.201043]Search in Google Scholar
[Byrd, R. H., Nocedal, J. and Waltz, R. A. (2008). Steering exact penalty methods for nonlinear programming, Optimization Methods & Software 23(2): 197-213.10.1080/10556780701394169]Search in Google Scholar
[Correia, A., Matias, J., Mestre, P. and Serôdio, C. (2009). Derivative-free optimization and filter methods to solve nonlinear constrained problems, International Journal of Computer Mathematics 86(10): 1841-1851.10.1080/00207160902775090]Search in Google Scholar
[Fletcher, R. and Leyffer, S. (2002). Nonlinear programming without a penalty function, Mathematical Programming. Series A 91(2): 239-269.]Search in Google Scholar
[Fletcher, R., Leyffer, S. and Toint, P. L. (2006). A brief history of filter method, Technical Report ANL/MCS-P1372-0906, Argonne National Laboratory, Mathematics and Computer Science Division, Argonne, IL.]Search in Google Scholar
[Karas, E. W., Ribeiro, A. A., Sagastizábal, C. and Solodov, M. (2006). A bundle-filter method for nonsmooth convex constrained optimization, Mathematical Programming 1(116): 297-320.10.1007/s10107-007-0123-7]Search in Google Scholar
[Nelder, J. A. and Mead, R. (1965). A simplex method for function minimization, The Computer Journal 7(4): 308-313.10.1093/comjnl/7.4.308]Search in Google Scholar