Implementation of Cartesian grids to accelerate Delaunay-based derivative-free optimization
type: Item
instance of: scholarly article
title: Implementation of Cartesian grids to accelerate Delaunay-based derivative-free optimization
zbMATH Open document ID: 1386.90180
author: Pooriya Beyhaghi
author: Thomas R. Bewley
published in: Journal of Global Optimization
publication date: 2017-12-14T00:00:00Z
Mathematics Subject Classification ID: 90C56
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 6818688
zbMATH Keywords: derivative-free optimization
zbMATH Keywords: surrogate functions
zbMATH Keywords: Delaunay triangulation
zbMATH Keywords: Cartesian grid
describes a project that uses: OrthoMADS
MaRDI profile type: Publication
full work available at URL: s10898-017-0548-3
OpenAlex ID: W2745050026
cites work: OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
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: New horizons in sphere-packing theory, part II: Lattice-based derivative-free optimization via global surrogates
cites work: Delaunay-based derivative-free optimization via global surrogates. I: Linear constraints
cites work: Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints
cites work: The cubic algorithm
cites work: Q4739659
cites work: Lipschitzian optimization without the Lipschitz constant
cites work: A taxonomy of global optimization methods based on response surfaces
cites work: Direct search methods: Then and now
cites work: Numerical Optimization
cites work: Simplicial Global Optimization
cites work: Q3394879
cites work: A Sequential Method Seeking the Global Maximum of a Function
cites work: On the Convergence of Pattern Search Algorithms
DOI: 10.1007/S10898-017-0548-3
description: scientific article; zbMATH DE number 6818688