DFL

swMATH5163MaRDI QIDQ17303FDOQ17303

Author name not available (Why is that?)

Described by source

• Derivative-free methods for bound constrained mixed-integer optimization

Cited In (41)

• A trust-region-based derivative free algorithm for mixed integer programming
• Adaptive sampling line search for local stochastic optimization with integer variables
• Parallelized hybrid optimization methods for nonsmooth problems using NOMAD and linesearch
• A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints
• Binary, unrelaxable and hidden constraints in blackbox optimization
• Escaping local minima with local derivative-free methods: a numerical investigation
• Derivative free methodologies for circuit worst case analysis
• A sharp augmented Lagrangian-based method in constrained non-convex optimization
• An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables
• Derivative-free methods for mixed-integer constrained optimization problems
• A DIRECT-type approach for derivative-free constrained global optimization
• A derivative-free exact penalty algorithm: basic ideas, convergence theory and computational studies
• Review and comparison of algorithms and software for mixed-integer derivative-free optimization
• A derivative-free algorithm for constrained global optimization based on exact penalty functions
• Derivative-free robust optimization for circuit design
• Essentials of numerical nonsmooth optimization
• A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization
• Unified approach for solving box-constrained models with continuous or discrete variables by non monotone direct search methods
• Non-monotone derivative-free algorithm for solving optimization models with linear constraints: extensions for solving nonlinearly constrained models via exact penalty methods
• A Derivative-Free Approach to Constrained Multiobjective Nonsmooth Optimization
• Filter-based DIRECT method for constrained global optimization
• Global optimization for mixed categorical-continuous variables based on Gaussian process models with a randomized categorical space exploration step
• Derivative-free methods for mixed-integer nonsmooth constrained optimization
• Convergent inexact penalty decomposition methods for cardinality-constrained problems
• A pattern search and implicit filtering algorithm for solving linearly constrained minimization problems with noisy objective functions
• A derivative-free optimization approach for the autotuning of a forex trading strategy
• A derivative-free approach for a simulation-based optimization problem in healthcare
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
• Quantifying uncertainty with ensembles of surrogates for blackbox optimization
• A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations
• Trust-Region Methods for the Derivative-Free Optimization of Nonsmooth Black-Box Functions
• Direct search nonsmooth constrained optimization via rounded ℓ₁ penalty functions
• Combining global and local strategies to optimize parameters in magnetic spacecraft control via attitude feedback
• A New Sequential Optimality Condition for Constrained Nonsmooth Optimization
• A method for convex black-box integer global optimization
• A penalty derivative-free algorithm for nonlinear constrained optimization
• The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables
• Applying the pattern search implicit filtering algorithm for solving a noisy problem of parameter identification
• A geometric integration approach to nonsmooth, nonconvex optimisation
• Derivative-free optimization methods
• Essentials of numerical nonsmooth optimization

This page was built for software: DFL