Using Simplex Gradients of Nonsmooth Functions in Direct Search Methods

A. L. Custódio (alcustodiofct.unl.pt)
J. E. Dennis (dennisrice.edu)
L. N. Vicente (lnvmat.uc.pt)

Abstract: It has been shown recently that the efficiency of direct search methods that use opportunistic polling in positive spanning directions can be improved significantly by reordering the poll directions according to descent indicators built from simplex gradients. The purpose of this paper is twofold. First, we analyze the properties of simplex gradients of nonsmooth functions in the context of direct search methods like the Generalized Pattern Search (GPS) and the Mesh Adaptive Direct Search (MADS), for which there exists a convergence analysis in the nonsmooth setting. Our analysis does not require continuous differentiability and can be seen as an extension of the accuracy properties of simplex gradients known for smooth functions. Secondly, we test the use of simplex gradients when pattern search is applied to nonsmooth functions, confirming the merit of the poll ordering strategy for such problems.

Keywords: derivative free optimization, simplex gradients, poisedness, nonsmooth analysis, generalized pattern search methods, mesh adaptive direct search

Category 1: Nonlinear Optimization (Unconstrained Optimization )

Citation: Preprint 06-48, Department of Mathematics, University of Coimbra, Portugal, October 2006

Download: [PDF]

Entry Submitted: 10/27/2006
Entry Accepted: 10/27/2006
Entry Last Modified: 10/27/2006

Modify/Update this entry