Implementation of Cartesian grids to accelerate Delaunay-based derivative-free optimization
From MaRDI portal
Publication:1685588
DOI10.1007/s10898-017-0548-3zbMath1386.90180OpenAlexW2745050026MaRDI QIDQ1685588
Pooriya Beyhaghi, Thomas R. Bewley
Publication date: 14 December 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-017-0548-3
Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items (3)
SMGO-\(\Delta\): balancing caution and reward in global optimization with black-box constraints ⋮ A derivative-free optimization algorithm for the efficient minimization of functions obtained via statistical averaging ⋮ Design of IMEXRK time integration schemes via Delaunay-based derivative-free optimization with nonconvex constraints and grid-based acceleration
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Delaunay-based derivative-free optimization via global surrogates. I: Linear constraints
- Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints
- The cubic algorithm
- Lipschitzian optimization without the Lipschitz constant
- Direct search methods: Then and now
- 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
- Simplicial Global Optimization
- On the Convergence of Pattern Search Algorithms
- OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
- Numerical Optimization
- A Pattern Search Filter Method for Nonlinear Programming without Derivatives
- A Progressive Barrier for Derivative-Free Nonlinear Programming
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- A Sequential Method Seeking the Global Maximum of a Function
This page was built for publication: Implementation of Cartesian grids to accelerate Delaunay-based derivative-free optimization
