GLODS: global and local optimization using direct search
type: Item
instance of: scholarly article
title: GLODS: global and local optimization using direct search
zbMATH Open document ID: 1328.90161
author: A. L. Custódio
author: J. F. A. Madeira
published in: Journal of Global Optimization
publication date: 2015-06-18T00:00:00Z
Mathematics Subject Classification ID: 90C56
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 6447166
zbMATH Keywords: global optimization
zbMATH Keywords: multistart strategies
zbMATH Keywords: direct-search methods
zbMATH Keywords: pattern-search methods
zbMATH Keywords: nonsmooth calculus
describes a project that uses: SNOBFIT
describes a project that uses: AQUARS
describes a project that uses: PSwarm
describes a project that uses: CGLS
describes a project that uses: MCS
describes a project that uses: DIRECT
MaRDI profile type: Publication
full work available at URL: s10898-014-0224-9
OpenAlex ID: W1982532564
Wikidata QID: Q57591806
cites work: A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
cites work: Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search
cites work: Analysis of Generalized Pattern Searches
cites work: A Pattern Search Filter Method for Nonlinear Programming without Derivatives
cites work: Mesh Adaptive Direct Search Algorithms for Constrained Optimization
cites work: A Progressive Barrier for Derivative-Free Nonlinear Programming
cites work: A new version of the Price's algorithm for global optimization
cites work: Optimization and nonsmooth analysis
cites work: Introduction to Derivative-Free Optimization
cites work: Theory of Positive Linear Dependence
cites work: Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization
cites work: Tabu search directed by direct search methods for nonlinear global optimization
cites work: Global optimization by multilevel coordinate search
cites work: Q4715202
cites work: Lipschitzian optimization without the Lipschitz constant
cites work: Stochastic global optimization methods part I: Clustering methods
cites work: Stochastic global optimization methods part II: Multi level methods
cites work: Computational investigations of low-discrepancy sequences
cites work: Q4435425
cites work: Relaxing the assumptions of the multilevel single linkage algorithm
cites work: A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
cites work: Benchmarking Derivative-Free Optimization Algorithms
cites work: Q5491447
cites work: A combined global \& local search (CGLS) approach to global optimization
cites work: A quasi-multistart framework for global optimization of expensive functions using response surface models
cites work: The design and analysis of computer experiments.
cites work: Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
cites work: On the Convergence of Pattern Search Algorithms
cites work: A particle swarm pattern search method for bound constrained global optimization
cites work: Analysis of direct searches for discontinuous functions
DBLP publication ID: journals/jgo/CustodioM15
DOI: 10.1007/S10898-014-0224-9
description: scientific article