An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables
From MaRDI portal
Publication:2220918
Recommendations
- A black-box scatter search for optimization problems with integer variables
- A method for convex black-box integer global optimization
- Black-box combinatorial optimization using models with integer-valued minima
- Derivative-free methods for mixed-integer nonsmooth constrained optimization
- A survey on direct search methods for blackbox optimization and their applications
Cites work
- A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations
- A derivative-free nonmonotone line-search technique for unconstrained optimization
- A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization
- A trust-region-based derivative free algorithm for mixed integer programming
- Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm
- An Algorithm Model for Mixed Variable Programming
- Benchmarking Derivative-Free Optimization Algorithms
- BFO, a trainable derivative-free brute force optimizer for nonlinear bound-constrained optimization and equilibrium computations with continuous and discrete variables
- Derivative-free and blackbox optimization
- Derivative-free methods for bound constrained mixed-integer optimization
- Derivative-free methods for mixed-integer constrained optimization problems
- Filter pattern search algorithms for mixed variable constrained optimization problems
- Handbook of metaheuristics
- scientific article; zbMATH DE number 2050711 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- Introduction to Derivative-Free Optimization
- Mesh adaptive direct search algorithms for mixed variable optimization
- MISO: mixed-integer surrogate optimization framework
- New Sequential and Parallel Derivative-Free Algorithms for Unconstrained Minimization
- On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals
- OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
- Pattern search algorithms for mixed variable programming
- RBFOpt: an open-source library for black-box optimization with costly function evaluations
- SO-I: a surrogate model algorithm for expensive nonlinear integer programming problems including global optimization applications
- SO-MI: a surrogate model algorithm for computationally expensive nonlinear mixed-integer black-box global optimization problems
- The mesh adaptive direct search algorithm for granular and discrete variables
- Variable neighborhood search
Cited in
(18)- Black-box combinatorial optimization using models with integer-valued minima
- A method for convex black-box integer global optimization
- Review and comparison of algorithms and software for mixed-integer derivative-free optimization
- Derivative-free methods for mixed-integer nonsmooth constrained optimization
- On the implementation of a global optimization method for mixed-variable problems
- A simulation-based optimization approach for the calibration of a discrete event simulation model of an emergency department
- Subspace dynamic-simplex linear interpolation search for mixed-integer black-box optimization problems
- The mesh adaptive direct search algorithm for granular and discrete variables
- Exploiting Problem Structure in Derivative Free Optimization
- Escaping local minima with local derivative-free methods: a numerical investigation
- Derivative-free optimization methods
- TESTINT
- The ambulance diversion phenomenon in an emergency department network: a case study
- Combining gradient information and primitive directions for high-performance bound-constrained mixed-integer optimization
- A derivative-free approach to mixed integer constrained multiobjective nonsmooth black-box optimization
- MATRS: heuristic methods for noisy derivative-free bound-constrained mixed-integer optimization
- An augmented Lagrangian-based method using primitive directions for mixed-integer nonlinear problems
- A black-box scatter search for optimization problems with integer variables
This page was built for publication: An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2220918)
