Analysis of direct searches for discontinuous functions

It is known that the Clarke generalized directional derivative is nonnegative along the limit directions generated by directional direct-search methods at a limit point of certain subsequences of unsuccessful iterates, if the function being minimized is Lipschitz continuous near the limit point. In this paper we generalize this result for discontinuous functions using Rockafellar generalized directional derivatives (upper subderivatives). We show that Rockafellar derivatives are also nonnegative along the limit directions of those subsequences of unsuccessful iterates when the function values converge to the function value at the limit point. This result is obtained assuming that the function is directionally Lipschitz with respect to the limit direction. It is also possible under appropriate conditions to establish more insightful results by showing that the sequence of points generated by these methods eventually approaches the limit point along the locally best branch or step function (when the number of steps is equal to two). The results of this paper are presented for constrained optimization and illustrated numerically.

[1]  L. N. Vicente,et al.  Using simplex gradients of nonsmooth functions in direct search methods , 2008 .

[2]  Mei Han An,et al.  accuracy and stability of numerical algorithms , 1991 .

[3]  R. Tyrrell Rockafellar,et al.  Convex Analysis , 1970, Princeton Landmarks in Mathematics and Physics.

[4]  Katya Scheinberg,et al.  Introduction to derivative-free optimization , 2010, Math. Comput..

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

[6]  E. J. McShane,et al.  Extension of range of functions , 1934 .

[7]  CHARLES AUDET,et al.  Finding Optimal Algorithmic Parameters Using Derivative-Free Optimization , 2006, SIAM J. Optim..

[8]  Mike C. Bartholomew-Biggs,et al.  Optimizing Omega , 2009, J. Glob. Optim..

[9]  N. Higham Optimization by Direct Search in Matrix Computations , 1993, SIAM J. Matrix Anal. Appl..

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

[11]  Tamara G. Kolda,et al.  Optimization by Direct Search: New Perspectives on Some Classical and Modern Methods , 2003, SIAM Rev..

[12]  Charles Audet,et al.  Convergence of Mesh Adaptive Direct Search to Second-Order Stationary Points , 2006, SIAM J. Optim..

[13]  Charles Audet,et al.  Analysis of Generalized Pattern Searches , 2000, SIAM J. Optim..

[14]  R. Rockafellar Generalized Directional Derivatives and Subgradients of Nonconvex Functions , 1980, Canadian Journal of Mathematics.

[15]  J. Jahn Introduction to the Theory of Nonlinear Optimization , 1994 .

[16]  Virginia Torczon,et al.  On the Convergence of Pattern Search Algorithms , 1997, SIAM J. Optim..

[17]  Maria Grazia Gasparo,et al.  Generating Set Search Methods for Piecewise Smooth Problems , 2009, SIAM J. Optim..

[18]  Qi Tang,et al.  Applying a Global Optimisation Algorithm to Fund of Hedge Funds Portfolio Optimisation , 2009 .