Delaunay-based derivative-free optimization via global surrogates. I: Linear constraints

DOI10.1007/s10898-015-0384-2zbMath1383.90045OpenAlexW2248073663MaRDI QIDQ727384

Pooriya Beyhaghi, Daniele Cavaglieri, Thomas R. Bewley

Publication date: 6 December 2016

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-015-0384-2

zbMATH Keywords

linear constraintsDelaunay triangulationderivative-free optimizationsurrogate functions

Mathematics Subject Classification ID

Derivative-free methods and methods using generalized derivatives (90C56)

Related Items (5)

Implementation of Cartesian grids to accelerate Delaunay-based derivative-free optimization ⋮ A new partition method for DIRECT-type algorithm based on minimax design ⋮ Design of IMEXRK time integration schemes via Delaunay-based derivative-free optimization with nonconvex constraints and grid-based acceleration ⋮ Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints ⋮ Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints

Uses Software

• Qhull
• DACE
• Triangle

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Higher-dimensional Voronoi diagrams in linear expected time
• A faster divide-and-conquer algorithm for constructing Delaunay triangulations
• The expected number of \(k\)-faces of a Voronoi diagram
• Generating well-shaped \(d\)-dimensional Delaunay meshes.
• Direct search methods: Then and now
• Delaunay refinement algorithms for triangular mesh generation
• A taxonomy of global optimization methods based on response surfaces
• New horizons in sphere-packing theory, part II: Lattice-based derivative-free optimization via global surrogates
• Finding all vertices of a convex polyhedron
• On the Convergence of Pattern Search Algorithms
• An Algorithm for Finding All Vertices of Convex Polyhedral Sets
• A method for globally minimizing concave functions over convex sets
• A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
• Newton-type methods for unconstrained and linearly constrained optimization
• Numerical Optimization
• Convex Polyhedra
• An efficient method for finding the minimum of a function of several variables without calculating derivatives
• Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension
• The maximum numbers of faces of a convex polytope
• Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation
• Global optimization
• A radial basis function method for global optimization

This page was built for publication: Delaunay-based derivative-free optimization via global surrogates. I: Linear constraints