Delaunay-based derivative-free optimization via global surrogates. I: Linear constraints
From MaRDI portal
Publication:727384
DOI10.1007/S10898-015-0384-2zbMATH Open1383.90045OpenAlexW2248073663MaRDI QIDQ727384FDOQ727384
Authors: 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
Recommendations
- Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints
- Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints
- A derivative-free algorithm for linearly constrained optimization problems
- A DIRECT-type approach for derivative-free constrained global optimization
- A derivative-free method for linearly constrained nonsmooth optimization
- A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization
- A derivative-free algorithm for spherically constrained optimization
- Implementation of Cartesian grids to accelerate Delaunay-based derivative-free optimization
- A derivative-free algorithm for constrained global optimization based on exact penalty functions
- scientific article; zbMATH DE number 724204
Cites Work
- Numerical Optimization
- Title not available (Why is that?)
- Gaussian processes for machine learning.
- An efficient method for finding the minimum of a function of several variables without calculating derivatives
- A taxonomy of global optimization methods based on response surfaces
- Title not available (Why is that?)
- Nature-inspired optimization algorithms
- On the Convergence of Pattern Search Algorithms
- Newton-type methods for unconstrained and linearly constrained optimization
- The maximum numbers of faces of a convex polytope
- A radial basis function method for global optimization
- Title not available (Why is that?)
- Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension
- Direct search methods: Then and now
- Delaunay refinement algorithms for triangular mesh generation
- Finding all vertices of a convex polyhedron
- Convex Polyhedra
- Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation
- Global optimization
- A faster divide-and-conquer algorithm for constructing Delaunay triangulations
- Higher-dimensional Voronoi diagrams in linear expected time
- A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
- An Algorithm for Finding All Vertices of Convex Polyhedral Sets
- A method for globally minimizing concave functions over convex sets
- Generating well-shaped \(d\)-dimensional Delaunay meshes.
- The expected number of \(k\)-faces of a Voronoi diagram
- New horizons in sphere-packing theory, part II: Lattice-based derivative-free optimization via global surrogates
- Generating well-shaped Delaunay meshes in 3D
Cited In (8)
- 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
- Enumerating Delaunay partitions and global optimization
- A new partition method for DIRECT-type algorithm based on minimax design
- Implementation of Cartesian grids to accelerate Delaunay-based derivative-free optimization
- New horizons in sphere-packing theory, part II: Lattice-based derivative-free optimization via global surrogates
- A derivative-free optimization algorithm for the efficient minimization of functions obtained via statistical averaging
Uses Software
This page was built for publication: Delaunay-based derivative-free optimization via global surrogates. I: Linear constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q727384)
