Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints
From MaRDI portal
Publication:785630
DOI10.1007/s10898-019-00854-2zbMath1447.90035OpenAlexW4242995906WikidataQ126306471 ScholiaQ126306471MaRDI QIDQ785630
Ryan Alimo, Pooriya Beyhaghi, Thomas R. Bewley
Publication date: 7 August 2020
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-019-00854-2
Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items
SMGO-\(\Delta\): balancing caution and reward in global optimization with black-box constraints, 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
- Unnamed Item
- Shape optimization of pulsatile ventricular assist devices using FSI to minimize thrombotic risk
- On solving large-scale finite minimax problems using exponential smoothing
- Algorithms with adaptive smoothing for finite minimax problems
- Delaunay-based derivative-free optimization via global surrogates. I: Linear constraints
- Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints
- SCIP: solving constraint integer programs
- A computational framework for derivative-free optimization of cardiovascular geometries
- Efficient global optimization of expensive black-box functions
- Lipschitzian optimization without the Lipschitz constant
- Design and analysis of computer experiments. With comments and a rejoinder by the authors
- A polyhedral branch-and-cut approach to 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
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Optimal aeroacoustic shape design using the surrogate management framework
- Algorithm 909
- On the Convergence of Pattern Search Algorithms
- Branching and bounds tighteningtechniques for non-convex MINLP
- OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
- ORBIT: Optimization by Radial Basis Function Interpolation in Trust-Regions
- A method for globally minimizing concave functions over convex sets
- 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
- A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds
- On the Global Convergence of a Filter--SQP Algorithm
- Interior Methods for Nonlinear Optimization
- Convex Optimization in Signal Processing and Communications
- A Progressive Barrier for Derivative-Free Nonlinear Programming
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- On the Performance of SQP Methods for Nonlinear Optimization
- Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
