Trust-Region Methods for the Derivative-Free Optimization of Nonsmooth Black-Box Functions

In this paper we study the minimization of a nonsmooth black-box type function, without assuming any access to derivatives or generalized derivatives and without any knowledge about the analytical ...

[1]  Krzysztof C. Kiwiel,et al.  Proximity control in bundle methods for convex nondifferentiable minimization , 1990, Math. Program..

[2]  Charles Audet,et al.  Mesh Adaptive Direct Search Algorithms for Constrained Optimization , 2006, SIAM J. Optim..

[3]  Luís N. Vicente,et al.  Analysis of direct searches for discontinuous functions , 2012, Math. Program..

[4]  Charles Audet,et al.  Model-Based Methods in Derivative-Free Nonsmooth Optimization , 2018 .

[5]  Sébastien Le Digabel,et al.  Algorithm xxx : NOMAD : Nonlinear Optimization with the MADS algorithm , 2010 .

[6]  K. Kiwiel.  Methods of Descent for Nondifferentiable Optimization , 1985 .

[7]  A. Bagirov,et al.  Discrete Gradient Method: Derivative-Free Method for Nonsmooth Optimization , 2008 .

[8]  Jochem Zowe,et al.  A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results , 1992, SIAM J. Optim..

[9]  John E. Dennis,et al.  Numerical methods for unconstrained optimization and nonlinear equations , 1983, Prentice Hall series in computational mathematics.

[10]  Katya Scheinberg,et al.  Convergence of Trust-Region Methods Based on Probabilistic Models , 2013, SIAM J. Optim..

[11]  Stefan M. Wild,et al.  Manifold Sampling for Optimization of Nonconvex Functions That Are Piecewise Linear Compositions of Smooth Components , 2018, SIAM J. Optim..

[12]  J. Halton.  On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals , 1960 .

[13]  John L. Nazareth,et al.  Introduction to derivative-free optimization , 2010, Math. Comput..

[14]  Ya-Xiang Yuan,et al.  A derivative-free trust-region algorithm for composite nonsmooth optimization , 2014, Computational and Applied Mathematics.

[15]  Stefano Lucidi,et al.  A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization , 2014, SIAM J. Optim..

[16]  J. E. Kelley,et al.  The Cutting-Plane Method for Solving Convex Programs , 1960 .

[17]  Antonio Frangioni,et al.  Generalized Bundle Methods , 2002, SIAM J. Optim..

[18]  F. Clarke.  Optimization And Nonsmooth Analysis , 1983 .

[19]  Katya Scheinberg,et al.  Global Convergence of General Derivative-Free Trust-Region Algorithms to First- and Second-Order Critical Points , 2009, SIAM J. Optim..

[20]  Krzysztof C. Kiwiel,et al.  A Nonderivative Version of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization , 2010, SIAM J. Optim..

[21]  Krzysztof C. Kiwiel,et al.  A tilted cutting plane proximal bundle method for convex nondifferentiable optimization , 1991, Oper. Res. Lett..

[22]  Yurii Nesterov,et al.  New variants of bundle methods , 1995, Math. Program..

[23]  Katya Scheinberg,et al.  Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization , 2012, Mathematical Programming.

[24]  Napsu Karmitsa,et al.  Test problems for large-scale nonsmooth minimization , 2007 .

[25]  Marko Mäkelä,et al.  Survey of Bundle Methods for Nonsmooth Optimization , 2002, Optim. Methods Softw..

[26]  A. A. Goldstein,et al.  Newton's method for convex programming and Tchebycheff approximation , 1959, Numerische Mathematik.

[27]  Stefan M. Wild,et al.  Benchmarking Derivative-Free Optimization Algorithms , 2009, SIAM J. Optim..

[28]  Jan Vlcek,et al.  A bundle-Newton method for nonsmooth unconstrained minimization , 1998, Math. Program..

[29]  Warren Hare,et al.  A derivative-free approximate gradient sampling algorithm for finite minimax problems , 2013, Comput. Optim. Appl..

[30]  L. N. Vicente,et al.  Complexity and global rates of trust-region methods based on probabilistic models , 2018 .

[31]  Manlio Gaudioso,et al.  A bundle type approach to the unconstrained minimization of convex nonsmooth functions , 1982, Math. Program..

[32]  S. Nobakhtian,et al.  A new trust region method for nonsmooth nonconvex optimization , 2018 .

[33]  Luís Nunes Vicente,et al.  Trust-Region Methods Without Using Derivatives: Worst Case Complexity and the NonSmooth Case , 2016, SIAM J. Optim..