Use of quadratic models with mesh-adaptive direct search for constrained black box optimization

References

• Abramson , M. A. , Audet , C. , Chrissis , J. W. and Walston , J. G. 2009 . Mesh adaptive direct search algorithms for mixed variable optimization . Optim. Lett. , 3 ( 1 ) : 35 – 47 .
   Web of Science ®Google Scholar
• Abramson , M. A. , Audet , C. , Dennis , J. E. Jr and Le Digabel , S. 2009 . OrthoMADS: A deterministic MADS instance with orthogonal directions . SIAM J. Optim. , 20 ( 2 ) : 948 – 966 .
   Web of Science ®Google Scholar
• M.A. Abramson, C. Audet, G. Couture, J.E. Dennis, Jr, and S. Le Digabel, The NOMAD project; Software available at http://www.gerad.ca/nomad
   Google Scholar
• Audet , C. 2004 . Convergence results for pattern search algorithms are tight . Optim. Eng. , 5 ( 2 ) : 101 – 122 .
   Web of Science ®Google Scholar
• Audet , C. and Dennis , J. E. Jr . 2003 . Analysis of generalized pattern searches . SIAM J. Optim. , 13 ( 3 ) : 889 – 903 .
   Web of Science ®Google Scholar
• Audet , C. and Dennis , J. E. Jr . 2006 . Mesh adaptive direct search algorithms for constrained optimization . SIAM J. Optim. , 17 ( 1 ) : 188 – 217 .
   Web of Science ®Google Scholar
• Audet , C. and Dennis , J. E. Jr . 2009 . A progressive barrier for derivative-free nonlinear programming . SIAM J. Optim. , 20 ( 4 ) : 445 – 472 .
   Web of Science ®Google Scholar
• Audet , C. , Béchard , V. and Le Digabel , S. 2008 . Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search . J. Glob. Optim. , 41 ( 2 ) : 299 – 318 .
   Web of Science ®Google Scholar
• Audet , C. , Custódio , A. L. and Dennis , J. E. Jr . 2008 . Erratum: Mesh adaptive direct search algorithms for constrained optimization . SIAM J. Optim. , 18 ( 4 ) : 1501 – 1503 .
   Web of Science ®Google Scholar
• Audet , C. , Dennis , J. E. Jr and Le Digabel , S. 2008 . Parallel space decomposition of the mesh adaptive direct search algorithm . SIAM J. Optim. , 19 ( 3 ) : 1150 – 1170 .
   Web of Science ®Google Scholar
• Booker , A. J. , Dennis , J. E. Jr , Frank , P. D. , Serafini , D. B. and Torczon , V. 1998 . Optimization using surrogate objectives on a helicopter test example, in Optimal Design and Control, Progress in Systems and Control Theory Edited by: Borggaard , J. , Burns , J. , Cliff , E. and Schreck , S. 49 – 58 . Birkhäuser, Cambridge, MA
   Google Scholar
• Booker , A. J. , Dennis , J. E. Jr , Frank , P. D. , Serafini , D. B. , Torczon , V. and Trosset , M. W. 1999 . A rigorous framework for optimization of expensive functions by surrogates . Struct. Multidiscip. Optim. , 17 ( 1 ) : 1 – 13 .
   Web of Science ®Google Scholar
• F.H. Clarke, Optimization and Nonsmooth Analysis, Wiley, New York, 1983; Reissued in 1990 by SIAM Publications, Philadelphia, as Vol. 5 in the series Classics in Applied Mathematics
   Google Scholar
• Conn , A. R. , Scheinberg , K. and Vicente , L. N. 2009 . Global convergence of general derivative-free trust-region algorithms to first and second order critical points . SIAM J. Optim. , 20 ( 1 ) : 387 – 415 .
   Web of Science ®Google Scholar
• A.R. Conn, K. Scheinberg, and L.N. Vicente, Introduction to Derivative-Free Optimization. MPS/SIAM Book Series on Optimization, SIAM, Philadelphia, 2009
   Google Scholar
• Custódio , A. L. and Vicente , L. N. 2007 . Using sampling and simplex derivatives in pattern search methods . SIAM J. Optim. , 18 ( 2 ) : 537 – 555 .
   Web of Science ®Google Scholar
• Custódio , A. L. , Dennis , J. E. Jr and Vicente , L. N. 2008 . Using simplex gradients of nonsmooth functions in direct search methods . IMA J. Numer. Anal. , 28 ( 4 ) : 770 – 784 .
   Web of Science ®Google Scholar
• Custódio , A. L. , Rocha , H. and Vicente , L. N. 2010 . Incorporating minimum Frobenius norm models in direct search . Comput. Optim. Appl. , 46 ( 2 ) : 265 – 278 .
   Web of Science ®Google Scholar
• Fasano , G. , Morales , J. L. and Nocedal , J. 2009 . On the geometry phase in model-based algorithms for derivative-free optimization . Optim. Methods Softw. , 24 ( 1 ) : 145 – 154 .
   Web of Science ®Google Scholar
• Fletcher , R. and Leyffer , S. 2002 . Nonlinear programming without a penalty function . Math. Program. Ser. A , 91 : 239 – 269 .
   Web of Science ®Google Scholar
• Gilmore , P. and Kelley , C. T. 1995 . An implicit filtering algorithm for optimization of functions with many local minima . SIAM J. Optim. , 5 ( 2 ) : 269 – 285 .
   Web of Science ®Google Scholar
• Golub , G. H. and Van Loan , C. F. 1996 . The singular value decomposition, in Matrix Computations , 3 , 70 – 71 . Baltimore, MD : The John Hopkins University Press . Chapter 2.5.3
   Google Scholar
• Gould , N. I.M. , Orban , D. and Toint , Ph. L. 2003 . CUTEr (and SifDec): A constrained and unconstrained testing environment, revisited . ACM Trans. Math. Softw. , 29 ( 4 ) : 373 – 394 .
   Web of Science ®Google Scholar
• A. Hedar, Global optimization test problems. Available at http://www-optima.amp.i.kyoto-u.ac.jp/member/student/hedar/Hedar_files/TestGO.htm
   Google Scholar
• Le Digabel , S. 2011 . Algorithm 909: NOMAD: Nonlinear optimization with the MADS algorithm . ACM Trans. Math. Softw. , 37 ( 4 ) : 44:1 – 44:15 .
   Web of Science ®Google Scholar
• Le Thi , H. A. , Vaz , A. I.F. and Vicente , L. N. 2011 . Optimizing radial basis functions by D.C. programming and its use in direct search for global derivative-free optimization . TOP , : 1 – 25 .
   Google Scholar
• L. Lukšan and J. Vlšek, Test problems for nonsmooth unconstrained and linearly constrained optimization, Tech. Rep. V-798, ICS AS CR, 2000
   Google Scholar
• Mladenović , N. and Hansen , P. 1997 . Variable neighborhood search . Comput. Oper. Res. , 24 ( 11 ) : 1097 – 1100 .
   Web of Science ®Google Scholar
• Moré , J. J. and Wild , S. M. 2009 . Benchmarking derivative-free optimization algorithms . SIAM J. Optim. , 20 ( 1 ) : 172 – 191 .
   Web of Science ®Google Scholar
• Powell , M. J.D. 2006 . The NEWUOA software for unconstrained optimization without derivatives, in Large-Scale Nonlinear Optimization, Vol. 83 of Nonconvex Optimization and its Applications , Edited by: Pardalos , P. , Pillo , G. and Roma , M. 255 – 297 . Springer .
   Google Scholar
• Santner , T. J. , Williams , B. J. and Notz , W. I. 2003 . Designs generated by Latin Hypercube sampling, in The Design and Analysis of Computer Experiments , 127 – 132 . New York : Springer . Chapter 5.2.2
   Google Scholar
• Scheinberg , K. and Toint , Ph. L. 2010 . Self-correcting geometry in model-based algorithms for derivative-free unconstrained optmization . SIAM J. Optim. , 20 ( 6 ) : 3512 – 3532 .
   Web of Science ®Google Scholar
• D.B. Serafini, A framework for managing models in nonlinear optimization of computationally expensive functions, Ph.D. thesis, Department of Computational and Applied Mathematics, Rice University, Houston, TX, 1998
   Google Scholar
• Torczon , V. 1997 . On the convergence of pattern search algorithms . SIAM J. Optim. , 7 ( 1 ) : 1 – 25 .
   Web of Science ®Google Scholar
• Wild , S. M. , Regis , R. G. and Shoemaker , C. A. 2008 . ORBIT: Optimization by radial basis function interpolation in trust-regions . SIAM J. Sci. Comput. , 30 ( 6 ) : 3197 – 3219 .
   Web of Science ®Google Scholar