Numerical experience with a derivative-free trust-funnel method for nonlinear optimization problems with general nonlinear constraints

References

• C. Audet and J.E. Dennis, A pattern search filter method for nonlinear programming without derivatives, SIAM J. Optim. 14(4) (2004), pp. 980–1010. doi: 10.1137/S105262340138983X
   Web of Science ®Google Scholar
• E.G. Birgin, J.M. Martínez, and M. Raydan, Nonmonotone spectral projected gradient methods on convex sets, SIAM J. Optim. 10(4) (2000), pp. 1196–1211. doi: 10.1137/S1052623497330963
   Web of Science ®Google Scholar
• P.T. Boggs and J.W. Tolle, A strategy for global convergence in a sequential quadratic programming algorithm, SIAM J. Numer. Anal. 26(3) (1989), pp. 600–623. doi: 10.1137/0726036
   Web of Science ®Google Scholar
• B. Colson, Trust-region algorithms for derivative-free optimization and nonlinear bilevel programming, Ph.D. diss., Department of Mathematics, FUNDP–University of Namur, Namur, Belgium, 2004.
   Google Scholar
• A.R. Conn, K. Scheinberg, and L.N. Vicente, Introduction to Derivative-Free Optimization, MPS-SIAM Book Series on Optimization, Philadelphia, 2009.
   Google Scholar
• F. Curtis, N.I.M. Gould, D. Robinson, and Ph.L. Toint, An interior-point trust-funnel algorithm for nonlinear optimization, Tech. Rep. naXys-02-2014, Department of Mathematics, University of Namur, 2014.
   Google Scholar
• E.D. Dolan and J.J. Moré, Benchmarking optimization software with performance profiles, Math. Program. 91(2) (2002), pp. 201–213. doi: 10.1007/s101070100263
   Web of Science ®Google Scholar
• N.I.M. Gould, D. Orban, and Ph.L. Toint, Cutest: a constrained and unconstrained testing environment with safe threads for mathematical optimization, Comput. Optim. Appl. 60(3) (2015), pp. 545–557. doi: 10.1007/s10589-014-9687-3
   Web of Science ®Google Scholar
• N.I.M. Gould, D.P. Robinson, and Ph.L. Toint, Corrigendum: Nonlinear programming without a penalty function or a filter, Tech. Rep. Namur Centre for Complex Systems (naXys), University of Namur, Namur, Belgium, 2011.
   Google Scholar
• N.I.M. Gould and Ph.L. Toint, Nonlinear programming without a penalty function or a filter, Math. Program. 122(1) (2010), pp. 155–196. doi: 10.1007/s10107-008-0244-7
   Web of Science ®Google Scholar
• S. Gratton, Ph.L. Toint, and A. Tröltzsch, An active-set trust-region method for bound-constrained nonlinear optimization without derivatives, Optim. Methods Softw. 26(4–5) (2011), pp. 875–896. doi: 10.1080/10556788.2010.549231
   Web of Science ®Google Scholar
• W. Hock and K. Schittkowski, Test examples for nonlinear programming codes, J. Optim. Theory Appl. 30(1) (1980), pp. 127–129. doi: 10.1007/BF00934594
   Google Scholar
• R.M. Lewis and V. Torczon, Pattern search methods for linearly constrained minimization, SIAM J. Optim. 10 (2000), pp. 917–941. doi: 10.1137/S1052623497331373
   Web of Science ®Google Scholar
• R.M. Lewis and V. Torczon, A globally convergent augmented Lagrangian pattern search algorithm for optimization with general constraints and simple bounds, SIAM J. Optim. 12(4) (2002), pp. 1075–1089. doi: 10.1137/S1052623498339727
   Web of Science ®Google Scholar
• R.M. Lewis and V. Torczon, Active set identification for linearly constrained minimization without explicit derivatives, SIAM J. Optim. 20(3) (2009), pp. 1378–1405. doi: 10.1137/08073545X
   Web of Science ®Google Scholar
• S. Lucidi, M. Sciandrone, and P. Tseng, Objective-derivative-free methods for constrained optimization, Math. Program, Ser. A 92 (2002), pp. 37–59. doi: 10.1007/s101070100266
   Web of Science ®Google Scholar
• J.J. Moré and S.M. Wild, Benchmarking derivative-free optimization algorithms, SIAM J. Optim.20(1) (2009), pp. 172–191. doi: 10.1137/080724083
   Web of Science ®Google Scholar
• M.J.D. Powell, A direct search optimization method that models the objective and constraint functions by linear interpolation, in Advances in Optimization and Numerical Analysis, Proceedings of the Sixth Workshop on Optimization and Numerical Analysis, Oaxaca, Mexico, Vol. 275, Dordrecht, The Netherlands, Kluwer Academic Publishers, 1994, pp. 51–67.
   Google Scholar
• M.J.D. Powell, Direct search algorithms for optimization calculations, Acta Numer. 7 (1998), pp. 287–336. doi: 10.1017/S0962492900002841
   Google Scholar
• M.J.D. Powell, On fast trust region methods for quadratic models with linear constraints, Tech. Rep. DAMTP 2014/NA02, Department of Applied Mathematics and Theoretical Physics, Cambridge University, Cambridge, England, 2014.
   Google Scholar
• Ph.R. Sampaio and Ph.L. Toint, A derivative-free trust-funnel method for equality-constrained nonlinear optimization, Comput. Optim. Appl. 61(1) (2015), pp. 25–49. doi: 10.1007/s10589-014-9715-3
   Web of Science ®Google Scholar
• K. Scheinberg and Ph.L. Toint, Self-correcting geometry in model-based algorithms for derivative-free unconstrained optimization, SIAM J. Optim. 20(6) (2010), pp. 3512–3532. doi: 10.1137/090748536
   Web of Science ®Google Scholar
• W.-C. Yu and Y.-X. Li, A direct search method by the local positive basis for the nonlinearly constrained optimization, Chinese Ann. Math. 2 (1981), pp. 269–280.
   Web of Science ®Google Scholar