A method for convex black-box integer global optimization
type: Item
instance of: scholarly article
title: A method for convex black-box integer global optimization
zbMATH Open document ID: 1473.90181
author: Jeffrey Larson
author: Prashant Palkar
author: Stefan M. Wild
author: Sven Leyffer
published in: Journal of Global Optimization
publication date: 2021-08-11T00:00:00Z
full work available at URL: https://arxiv.org/abs/1903.11366
Mathematics Subject Classification ID: 90C56
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 7380939
zbMATH Keywords: derivative-free optimization
zbMATH Keywords: integer optimization
zbMATH Keywords: simulation optimization
describes a project that uses: LDGB
describes a project that uses: MISO
describes a project that uses: MATSuMoTo
describes a project that uses: RBFOpt
describes a project that uses: MDTri
describes a project that uses: SO-I
describes a project that uses: convexity
describes a project that uses: BFO
describes a project that uses: NOMAD
describes a project that uses: Bonmin
describes a project that uses: DFL
describes a project that uses: DFLGEN
describes a project that uses: DFLBOX
MaRDI profile type: Publication
OpenAlex ID: W3134737918
arXiv ID: 1903.11366
cites work: Modeling without categorical variables: a mixed-integer nonlinear program for the optimization of thermal insulation systems
cites work: Mesh adaptive direct search algorithms for mixed variable optimization
cites work: Pattern search algorithms for mixed variable programming
cites work: Derivative-Free and Blackbox Optimization
cites work: The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables
cites work: An algorithmic framework for convex mixed integer nonlinear programs
cites work: Q4449438
cites work: Q3654591
cites work: Q4821526
cites work: Combinatorial optimal control of semilinear elliptic PDEs
cites work: Non-linear minimax optimization as a sequence of leastpth optimization with finite values ofp
cites work: An Efficient Method to Solve the Minimax Problem Directly
cites work: Introduction to Derivative-Free Optimization
cites work: RBFOpt: an open-source library for black-box optimization with costly function evaluations
cites work: A kriging based method for the solution of mixed-integer nonlinear programs containing black-box functions
cites work: Benchmarking optimization software with performance profiles.
cites work: An outer-approximation algorithm for a class of mixed-integer nonlinear programs
cites work: Solving mixed integer nonlinear programs by outer approximation
cites work: Unified approach for solving box-constrained models with continuous or discrete variables by non monotone direct search methods
cites work: Integer Programming Algorithms: A Framework and State-of-the-Art Survey
cites work: MDTri: robust and efficient global mixed integer search of spaces of multiple ternary alloys. A DIRECT-inspired optimization algorithm for experimentally accessible computational material design
cites work: New limited memory bundle method for large-scale nonsmooth optimization
cites work: A mixed-integer simulation-based optimization approach with surrogate functions in water resources management
cites work: Nonlinear Integer Programming
cites work: An adaptive radial basis algorithm (ARBF) for expensive black-box mixed-integer constrained global optimization
cites work: Estimating the Probability that a Function Observed with Noise Is Convex
cites work: An Ellipsoid Trust Region Bundle Method for Nonsmooth Convex Minimization
cites work: Q4435425
cites work: Derivative-free optimization methods
cites work: Algorithm 909
cites work: Derivative-free methods for bound constrained mixed-integer optimization
cites work: Derivative-free methods for mixed-integer constrained optimization problems
cites work: An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables
cites work: Benchmarking Derivative-Free Optimization Algorithms
cites work: MISO: mixed-integer surrogate optimization framework
cites work: SO-I: a surrogate model algorithm for expensive nonlinear integer programming problems including global optimization applications
cites work: SO-MI: a surrogate model algorithm for computationally expensive nonlinear mixed-integer black-box global optimization problems
cites work: A trust-region-based derivative free algorithm for mixed integer programming
cites work: BFO, A Trainable Derivative-free Brute Force Optimizer for Nonlinear Bound-constrained Optimization and Equilibrium Computations with Continuous and Discrete Variables
DOI: 10.1007/S10898-020-00978-W
description: scientific article