Adapting derivative free optimization methods to engineering models with discrete variables
From MaRDI portal
Publication:400044
DOI10.1007/s11081-011-9168-9zbMath1293.65092OpenAlexW2068601225MaRDI QIDQ400044
Enrique Costa-Montenegro, Ubaldo M. García-Palomares, Rafael Asorey-Cacheda, Francisco J. González-Castaño
Publication date: 20 August 2014
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11081-011-9168-9
Related Items (7)
Derivative-free methods for mixed-integer nonsmooth constrained optimization ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ Unified approach for solving box-constrained models with continuous or discrete variables by non monotone direct search methods ⋮ The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables ⋮ A derivative-free approach for a simulation-based optimization problem in healthcare ⋮ Derivative-free methods for mixed-integer constrained optimization problems ⋮ Review and comparison of algorithms and software for mixed-integer derivative-free optimization
Uses Software
Cites Work
- Implicitly and densely discrete black-box optimization problems
- The uncapacitated facility location problem with demand-dependent setup and service costs and customer-choice allocation
- Incorporating minimum Frobenius norm models in direct search
- Outdoor WLAN planning via non-monotone derivative-free optimization: Algorithm adaptation and case study
- Mesh adaptive direct search algorithms for mixed variable optimization
- A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem
- Stochastic global optimization: Problem classes and solution techniques
- Variable neighborhood search and local branching
- A combined global \& local search (CGLS) approach to global optimization
- Pattern Search Algorithms for Mixed Variable Programming
- A Robust Algorithm for Solving Nonlinear Programming Problems
- New Sequential and Parallel Derivative-Free Algorithms for Unconstrained Minimization
- On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization
- An Automated Framework for Accelerating Numerical Algorithms on Reconfigurable Platforms Using Algorithmic/Architectural Optimization
- An Algorithm Model for Mixed Variable Programming
- Finding Optimal Algorithmic Parameters Using Derivative‐Free Optimization
- Frame based methods for unconstrained optimization
- Variable neighborhood search: Principles and applications
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
This page was built for publication: Adapting derivative free optimization methods to engineering models with discrete variables
