An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables
type: Item
instance of: scholarly article
title: An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables
zbMATH Open document ID: 1452.90322
author: Giampaolo Liuzzi
author: Stefano Lucidi
author: F. Rinaldi
published in: Mathematical Programming Computation
publication date: 2021-01-25T00:00:00Z
Mathematics Subject Classification ID: 90C56
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 7300987
zbMATH Keywords: derivative free optimization
zbMATH Keywords: black box problems
zbMATH Keywords: integer variables
zbMATH Keywords: nonmonotone line search
describes a project that uses: NOMAD
describes a project that uses: DFL
describes a project that uses: DFLBOX
describes a project that uses: DFLGEN
describes a project that uses: OrthoMADS
describes a project that uses: SO-I
describes a project that uses: MISO
describes a project that uses: RBFOpt
describes a project that uses: DFN
describes a project that uses: DFLINT
describes a project that uses: BFO
MaRDI profile type: Publication
full work available at URL: s12532-020-00182-7
OpenAlex ID: W3008807310
cites work: Mesh adaptive direct search algorithms for mixed variable optimization
cites work: Q5440935
cites work: OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
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: Introduction to Derivative-Free Optimization
cites work: RBFOpt: an open-source library for black-box optimization with costly function evaluations
cites work: A derivative-free nonmonotone line-search technique for unconstrained optimization
cites work: A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization
cites work: New Sequential and Parallel Derivative-Free Algorithms for Unconstrained Minimization
cites work: Handbook of metaheuristics
cites work: Q4692508
cites work: A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations
cites work: On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals
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: Q4452900
cites work: An Algorithm Model for Mixed Variable Programming
cites work: Variable neighborhood search
cites work: Benchmarking Derivative-Free Optimization Algorithms
cites work: MISO: mixed-integer surrogate optimization framework
cites work: SO-MI: a surrogate model algorithm for computationally expensive nonlinear mixed-integer black-box global optimization problems
cites work: SO-I: a surrogate model algorithm for expensive nonlinear integer programming problems including global optimization applications
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/S12532-020-00182-7
description: scientific article