Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints
From MaRDI portal
Publication:727385
DOI10.1007/s10898-016-0433-5zbMath1384.90122OpenAlexW4249174623MaRDI QIDQ727385
Pooriya Beyhaghi, 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-016-0433-5
Related Items (6)
Implementation of Cartesian grids to accelerate Delaunay-based derivative-free optimization ⋮ 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 ⋮ A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints ⋮ A novel method based on similarity and triangulation for predicting the toxicities of various binary mixtures ⋮ Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hilbertian convex feasibility problem: Convergence of projection methods
- Delaunay-based derivative-free optimization via global surrogates. I: Linear constraints
- Higher-dimensional Voronoi diagrams in linear expected time
- Gradient algorithms for polygonal approximation of convex contours
- A faster divide-and-conquer algorithm for constructing Delaunay triangulations
- A collection of test problems for constrained global optimization algorithms
- The expected number of \(k\)-faces of a Voronoi diagram
- Lipschitzian optimization without the Lipschitz constant
- Handbook of global optimization
- 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
- Stochastic global optimization.
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- Optimal aeroacoustic shape design using the surrogate management framework
- Simplicial Global Optimization
- Algorithm 909
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- On the Convergence of Pattern Search Algorithms
- OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
- Newton-type methods for unconstrained and linearly constrained optimization
- Global Maximization of a Convex Function with Linear Inequality Constraints
- On Penalty and Multiplier Methods for Constrained Minimization
- Combined Primal–Dual and Penalty Methods for Convex Programming
- Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
- Pattern Search Methods for Linearly Constrained Minimization
- A Pattern Search Filter Method for Nonlinear Programming without Derivatives
- Pattern Search Algorithms for Bound Constrained Minimization
- On Projection Algorithms for Solving Convex Feasibility Problems
- A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds
- Interior Methods for Nonlinear Optimization
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- The Theory of the Chemostat
- A Progressive Barrier for Derivative-Free Nonlinear Programming
- Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- The maximum numbers of faces of a convex polytope
- A Sequential Method Seeking the Global Maximum of a Function
This page was built for publication: Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints
