Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints
From MaRDI portal
Publication:727385
Recommendations
- Delaunay-based derivative-free optimization via global surrogates. I: Linear constraints
- Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints
- A DIRECT-type approach for derivative-free constrained global optimization
- Objective-derivative-free methods for constrained optimization
- Implementation of Cartesian grids to accelerate Delaunay-based derivative-free optimization
Cites work
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 1860211 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 2219854 (Why is no real title available?)
- scientific article; zbMATH DE number 3048077 (Why is no real title available?)
- A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds
- A Pattern Search Filter Method for Nonlinear Programming without Derivatives
- A Sequential Method Seeking the Global Maximum of a Function
- A collection of test problems for constrained global optimization algorithms
- A faster divide-and-conquer algorithm for constructing Delaunay triangulations
- A progressive barrier for derivative-free nonlinear programming
- A taxonomy of global optimization methods based on response surfaces
- Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm
- Combined Primal–Dual and Penalty Methods for Convex Programming
- Delaunay-based derivative-free optimization via global surrogates. I: Linear constraints
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Gaussian processes for machine learning.
- Global Maximization of a Convex Function with Linear Inequality Constraints
- Gradient algorithms for polygonal approximation of convex contours
- Handbook of global optimization
- Higher-dimensional Voronoi diagrams in linear expected time
- Hilbertian convex feasibility problem: Convergence of projection methods
- Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension
- Interior Methods for Nonlinear Optimization
- Lipschitzian optimization without the Lipschitz constant
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- New horizons in sphere-packing theory, part II: Lattice-based derivative-free optimization via global surrogates
- Newton-type methods for unconstrained and linearly constrained optimization
- On Penalty and Multiplier Methods for Constrained Minimization
- On Projection Algorithms for Solving Convex Feasibility Problems
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- On the Convergence of Pattern Search Algorithms
- Optimal aeroacoustic shape design using the surrogate management framework
- OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
- Pattern Search Algorithms for Bound Constrained Minimization
- Pattern Search Methods for Linearly Constrained Minimization
- Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
- Simplicial global optimization
- Stochastic global optimization.
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- The Theory of the Chemostat
- The expected number of \(k\)-faces of a Voronoi diagram
- The maximum numbers of faces of a convex polytope
Cited in
(8)- Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints
- A novel method based on similarity and triangulation for predicting the toxicities of various binary mixtures
- Enumerating Delaunay partitions and global optimization
- 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
- Delaunay-based derivative-free optimization via global surrogates. I: Linear constraints
- A derivative-free optimization algorithm for the efficient minimization of functions obtained via statistical averaging
- Implementation of Cartesian grids to accelerate Delaunay-based derivative-free optimization
This page was built for publication: Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q727385)
