Derivative-free optimization and filter methods to solve nonlinear constrained problems

References

• Audet , C. and Dennis , J. E. 2004 . A pattern search filter method for nonlinear programming without derivatives . SIAM J. Optim. , 14 ( 4 ) : 980 – 1010 .
   Web of Science ®Google Scholar
• Bongartz , I. , Conn , A. R. , Gould , N. I. and Toint , P. L. 1995 . CUTE: Constrained and Unconstrained Testing Environment 123 – 160 . ACM Transactions on Mathematical Software: 21
   Google Scholar
• Bull , J. M. , Smith , L. A. , Ball , C. , Pottage , L. and Freeman , R. 2003 . Benchmarking Java against C and Fortran for scientific applications . Concurrency and Computation: Practice and Experience , 15 ( 3–5 ) : 417 – 430 .
   Google Scholar
• Byrd , R. H. , Nocedal , J. and Waltz , R. A. 2006 . “ Steering exact penalty methods for optimization ” . Evanston, , IL, USA : Optimization Technology Center, Northwestern University . Tech. Rep 60208
   Google Scholar
• Chen , L. and Goldfarb , D. 2005 . “ Interior-point l2-penalty methods for nonlinear programming with strong global convergence properties ” . New York : IEOR Department, Columbia University . Mathematical Programming, Tech. Rep
   Google Scholar
• Fletcher , R. and Leyffer , S. 1999 . “ A bundle filter method for nonsmooth nonlinear optimization ” . Dundee University, Department of Mathematics . Tech. Rep. NA/195
   Google Scholar
• Fletcher , R. and Leyffer , S. 2002 . Nonlinear programming without a penalty function . Math. Program.: Ser. A , 91 ( 2 ) : 239 – 269 .
   Web of Science ®Google Scholar
• Fletcher , R. , Leyffer , S. and Toint , P. L. 1998 . “ On the global convergence of an SLP-filter algorithm ” . Dundee University, Department of Mathematics . Tech. Rep. NA/183
   Google Scholar
• Fletcher , R. , Gould , N. , Leyffer , S. , Toint , P. L. and Wachter , A. 2002 . Global convergence of trust region and SQP-filter algorithms for general nonlinear programming . SIAM J. Optim. , 13 ( 3 ) : 635 – 659 .
   Web of Science ®Google Scholar
• Fletcher , R. , Leyffer , S. and Toint , P. L. 2006 . “ A brief history of filter method ” . Argonne National Laboratory, Mathematics and Computer Science Division . Tech. Rep. ANL/MCS-P1372-0906
   Google Scholar
• Gould , N. I.M. , Orban , D. and Toint , P. L. November 2003 . “ An interior-point l1-penalty method for nonlinear optimization ” . November , Oxfordshire, , UK Tech. Rep. RAL-TR-2003-022 Rutherford Appleton Laboratory Chilton
   Google Scholar
• Gould , N. I.M. , Leyffer , S. and Toint , P. L. 2005 . A multidimensional filter algorithm for nonlinear equations and nonlinear least-squares . SIAM J. Optim. , 15 ( 1 ) : 17 – 38 .
   Google Scholar
• Gould , N. I.M. , Sainvitu , C. and Toint , P. L. 2006 . A filter-trust-region method for unconstrained optimization . SIAM J. Optim. , 16 ( 2 ) : 341 – 357 .
   Google Scholar
• Hooke , R. and Jeeves , T. 1961 . Direct search solution of numerical and statistical problems . J. Assoc. Comput. Mach , 8 : 212 – 229 .
   Google Scholar
• Karas , E. , Ribeiro , A. , Sagastizábal , C. and Solodov , M. 2006 . A bundle-filter method for nonsmooth convex constrained optimization . Math. Program. , 116 ( 1 ) : 297 – 320 .
   Google Scholar
• Lewis , R. M. , Trosset , V. and Trosset , M. W. 2000 . Direct Search Methods: Then and Now , Virginia : NASA Langley Research Center . ICASE Report No. 2000-26
   Google Scholar
• Leyffer , S. , López-Calva , G. and Nocedal , J. 2006 . Interior Methods for Mathematical Programs with Complementarity Constraints . SIAM J. Optim. , 17 ( 1 ) : 52 – 77 .
   Web of Science ®Google Scholar
• Mongeau , M. and Sartenaer , A. 1995 . Automatic decrease of the penalty parameter in exact penalty function methods . Eur. J. Oper. Res. , 83 ( 3 ) : 686 – 699 .
   Web of Science ®Google Scholar
• Nelder , J. A. and Mead , R. 1965 . A simplex method for function minimization . Comput. J. , 7 : 308 – 313 .
   Web of Science ®Google Scholar
• Nikishkov , G. P. , Nikishkov , Yu. G. and Savchenko , V. V. 2003 . Comparison of C and Java performance in finite element computations . Comput. Struct. , 81 ( 24–25 ) : 2401 – 2408 .
   Google Scholar
• Powell , M. J.D. 1964 . An efficient method for finding the minimum of a function of several variables without calculating derivatives . Comput. J. , 7 : 155 – 162 .
   Web of Science ®Google Scholar
• Ulbrich , M. , Ulbrich , S. and Vicente , L. N. 2004 . A globally convergent primal-dual interior-point filter method for nonlinear programming . Math. Program. Ser. A , 100 ( 2 ) : 379 – 410 .
   Web of Science ®Google Scholar
• Zaslavski , A. J. 2005 . A sufficient condition for exact penalty in constrained optimization . SIAM J. , 16 ( 1 ) : 250 – 262 .
   Google Scholar