scholarly journals Using simplex gradients of nonsmooth functions in direct search methods

2008 ◽  
Vol 28 (4) ◽  
pp. 770-784 ◽  
Author(s):  
A. L. Custodio ◽  
J. E. Dennis ◽  
L. N. Vicente
Keyword(s):  
Direct Search ◽  
Search Methods ◽  
Direct Search Methods ◽  
Nonsmooth Functions

scholarly journals Calibration of parameters in Dynamic Energy Budget models using Direct-Search methods

2018 ◽  
Vol 78 (5) ◽  
pp. 1439-1458
Author(s):  
J. V. Morais ◽  
A. L. Custódio ◽  
G. M. Marques
Keyword(s):  
Energy Budget ◽  
Direct Search ◽  
Dynamic Energy Budget ◽  
Search Methods ◽  
Direct Search Methods

scholarly journals Equal Angle Distribution of Polling Directions in Direct-Search Methods

2014 ◽  
Vol 2014 ◽  
pp. 1-15
Author(s):  
Benjamin Van Dyke
Keyword(s):  
Direct Search ◽  
Regular Simplex ◽  
Angle Distribution ◽  
Test Results ◽  
Mesh Adaptive Direct Search ◽  
Search Methods ◽  
Direct Search Methods ◽  
Equal Angle ◽  
Constrained Problems ◽  
Orthogonal Set

The purpose of this paper is twofold: first, to introduce deterministic strategies for directional direct-search methods, including new instances of the mesh adaptive direct-search (MADS) and the generating set search (GSS) class of algorithms, which utilize a nice distribution of PoLLdirections when compared to other strategies, and second, to introduce variants of each algorithm which utilize a minimal positive basis at each step. The strategies base their PoLLdirections on the use of the QR decomposition to obtain an orthogonal set of directions or on using the equal angular directions from a regular simplex centered at the origin with vertices on the unit sphere. Test results are presented on a set of smooth, nonsmooth, unconstrained, and constrained problems that give comparisons between the various implementations of these directional direct-search methods.

Sign in / Sign up

Export Citation Format

Share Document