Skip to main content
Log in

Analysis of direct searches for discontinuous functions

Mathematical Programming Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abramson M.A., Audet C.: Convergence of mesh adaptive direct search to second-order stationary points. SIAM J. Optim. 17, 606–619 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  2. Arroyo, S., Cramer, E., Frank, P., Sabino, J.: Simultaneous aircraft design and airline fleet mix optimization using systems of systems optimization (2009)

  3. Audet C., Dennis J.E. Jr.: Analysis of generalized pattern searches. SIAM J. Optim. 13, 889–903 (2002)

    Article  MathSciNet  Google Scholar 

  4. Audet C., Dennis J.E. Jr.: Mesh adaptive direct search algorithms for constrained optimization. SIAM J. Optim. 17, 188–217 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  5. Audet C., Orban D.: Finding optimal algorithmic parameters using derivative-free optimization. SIAM J. Optim. 17, 642–664 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  6. Bogani C., Gasparo M.G., Papini A.: Generating set search methods for piecewise smooth problems. SIAM J. Optim. 20, 321–335 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  7. Cascon, A., Keating, C., Shadwick, W.: The Omega Function. Technical Report. The Finance Development Centre, London (2002)

  8. Clarke, F.H.: Optimization and Nonsmooth Analysis. John Wiley & Sons, New York (1983). Reissued by SIAM, Philadelphia (1990)

  9. Conn A.R., Scheinberg K., Vicente L.N.: Introduction to Derivative-Free Optimization, MPS-SIAM Series on Optimization. SIAM, Philadelphia (2009)

    Book  Google Scholar 

  10. Custódio A.L., Dennis J.E. Jr., Vicente L.N.: Using simplex gradients of nonsmooth functions in direct search methods. IMA J. Numer. Anal. 28, 770–784 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  11. Higham N.J.: Optimization by direct search in matrix computations. SIAM J. Matrix Anal. Appl. 14, 317–333 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  12. Higham N.J.: Accuracy and Stability of Numerical Algorithms. 2nd edn. SIAM, Philadelphia (2002)

    Book  MATH  Google Scholar 

  13. Jahn J.: Introduction to the Theory of Nonlinear Optimization. Springer-Verlag, Berlin (1996)

    MATH  Google Scholar 

  14. Kane S.J., Bartholomew-Biggs M.C., Cross M., Dewar M.: Optimizing omega. J. Glob. Optim. 45, 153–167 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  15. Kolda T.G., Lewis R.M., Torczon V.: Optimization by direct search: new perspectives on some classical and modern methods. SIAM Rev. 45, 385–482 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  16. McShane E.J.: Extension of range of functions. Bull. Am. Math. Soc. 40, 837–842 (1934)

    Article  MathSciNet  Google Scholar 

  17. Minsky, B., Obradovic, M., Tang, Q., Thapar, R.: Applying a global optimisation algorithm to fund of hedge funds portfolio optimisation (2009)

  18. \({{\tt NOMADm}}\). http://www.gerad.ca/NOMAD/Abramson/nomadm.html

  19. Rockafellar R.T.: Convex Analysis. Princeton University Press, Princeton (1970)

    MATH  Google Scholar 

  20. Rockafellar R.T.: Generalized directional derivatives and subgradients of nonconvex functions. Can. J. Math. 32, 257–280 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  21. Torczon V.: On the convergence of pattern search algorithms. SIAM J. Optim. 7, 1–25 (1997)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to L. N. Vicente.

Additional information

Support for L. N. Vicente’s research was provided by FCT under the grants PTDC/MAT/64838/2006 and PTDC/MAT/098214/2008. Part of this work was developed while this author was visiting the Courant Institute of Mathematical Sciences of New York University under a FLAD scholarship.

Support for A. L. Custódio was also provided by Centro de Matemática e Aplicações da Universidade Nova de Lisboa.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vicente, L.N., Custódio, A.L. Analysis of direct searches for discontinuous functions. Math. Program. 133, 299–325 (2012). https://doi.org/10.1007/s10107-010-0429-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-010-0429-8

Keywords

Mathematics Subject Classification (2000)

Navigation