Equal angle distribution of polling directions in direct-search methods
type: Item
instance of: scholarly article
title: Equal angle distribution of polling directions in direct-search methods
zbMATH Open document ID: 1327.65115
DOI: 10.1155/2014/619249
author: Benjamin Van Dyke
published in: Journal of Optimization
publication date: 2015-12-11T00:00:00Z
review text: Summary: 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 PoLL directions 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 PoLL directions 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.
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C56
zbMATH DE Number: 6519565
Wikidata QID: Q59060804
describes a project that uses: minpack
describes a project that uses: OrthoMADS
describes a project that uses: UFO
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2014/619249
OpenAlex ID: W2009777919
cites work: Analysis of direct searches for discontinuous functions
cites work: Mesh Adaptive Direct Search Algorithms for Constrained Optimization
cites work: Q4435425
cites work: Generalized Directional Derivatives and Subgradients of Nonconvex Functions
cites work: Convergence of Mesh Adaptive Direct Search to Second‐Order Stationary Points
cites work: Optimization and nonsmooth analysis
cites work: On the Convergence of Pattern Search Algorithms
cites work: OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
cites work: Frame based methods for unconstrained optimization
cites work: On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals
cites work: Using QR decomposition to obtain a new instance of mesh adaptive direct search with uniformly distributed polling directions
cites work: Reducing the Number of Function Evaluations in Mesh Adaptive Direct Search Algorithms
cites work: Pattern Search Methods for User-Provided Points: Application to Molecular Geometry Problems
cites work: Testing Unconstrained Optimization Software
cites work: Some new bounds for singular values and eigenvalues of matrix products
cites work: Erratum: Mesh Adaptive Direct Search Algorithms for Constrained Optimization
cites work: On the distribution of points in a cube and the approximate evaluation of integrals
cites work: Benchmarking Derivative-Free Optimization Algorithms
cites work: The concentration of measure phenomenon
cites work: A Progressive Barrier for Derivative-Free Nonlinear Programming
description: scientific article; zbMATH DE number 6519565