Implicitly and densely discrete black-box optimization problems

DOI10.1007/s11590-009-0120-2zbMath1170.90441OpenAlexW2146984835WikidataQ58040574 ScholiaQ58040574MaRDI QIDQ839812

Luis Nunes Vicente

Publication date: 3 September 2009

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-009-0120-2

zbMATH Keywords

projectiongridslocationderivative-free optimizationdirect searchrounding(dense) discrete optimization

Mathematics Subject Classification ID

Integer programming (90C10) Derivative-free methods and methods using generalized derivatives (90C56)

Related Items

Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Adapting derivative free optimization methods to engineering models with discrete variables, The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables, A derivative-free approach for a simulation-based optimization problem in healthcare, A trust-region-based derivative free algorithm for mixed integer programming, Derivative-free methods for mixed-integer constrained optimization problems, Review and comparison of algorithms and software for mixed-integer derivative-free optimization

Uses Software

• Matlab

Cites Work

• Unnamed Item
• Introduction to Derivative-Free Optimization
• Trust Region Methods
• Mesh Adaptive Direct Search Algorithms for Constrained Optimization