An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables
From MaRDI portal
Publication:2220918
DOI10.1007/s12532-020-00182-7zbMath1452.90322OpenAlexW3008807310MaRDI QIDQ2220918
Giampaolo Liuzzi, Stefano Lucidi, Francesco Rinaldi
Publication date: 25 January 2021
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-020-00182-7
Integer programming (90C10) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items
Derivative-free methods for mixed-integer nonsmooth constrained optimization, Exploiting Problem Structure in Derivative Free Optimization, On the implementation of a global optimization method for mixed-variable problems, Escaping local minima with local derivative-free methods: a numerical investigation, A simulation-based optimization approach for the calibration of a discrete event simulation model of an emergency department, The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables, A method for convex black-box integer global optimization, TESTINT, Derivative-free optimization methods, Review and comparison of algorithms and software for mixed-integer derivative-free optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- SO-MI: a surrogate model algorithm for computationally expensive nonlinear mixed-integer black-box global optimization problems
- SO-I: a surrogate model algorithm for expensive nonlinear integer programming problems including global optimization applications
- On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals
- A derivative-free nonmonotone line-search technique for unconstrained optimization
- Mesh adaptive direct search algorithms for mixed variable optimization
- Variable neighborhood search
- RBFOpt: an open-source library for black-box optimization with costly function evaluations
- Derivative-free methods for bound constrained mixed-integer optimization
- Derivative-free methods for mixed-integer constrained optimization problems
- MISO: mixed-integer surrogate optimization framework
- A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations
- A trust-region-based derivative free algorithm for mixed integer programming
- Pattern Search Algorithms for Mixed Variable Programming
- A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization
- Algorithm 909
- OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
- Introduction to Derivative-Free Optimization
- 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
- The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables
- New Sequential and Parallel Derivative-Free Algorithms for Unconstrained Minimization
- Benchmarking Derivative-Free Optimization Algorithms
- An Algorithm Model for Mixed Variable Programming
- Handbook of metaheuristics
