A trust-region-based derivative free algorithm for mixed integer programming
From MaRDI portal
Publication:2515071
DOI10.1007/s10589-014-9660-1zbMath1308.90112OpenAlexW1986346500WikidataQ57931909 ScholiaQ57931909MaRDI QIDQ2515071
Publication date: 10 February 2015
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-014-9660-1
Mixed integer programming (90C11) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items (12)
Linear transformation based solution methods for non-convex mixed integer quadratic programs ⋮ Sequential linear integer programming for integer optimal control with total variation regularization ⋮ Derivative-free methods for mixed-integer nonsmooth constrained optimization ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ On Integer Optimal Control with Total Variation Regularization on Multidimensional Domains ⋮ Convergence of derivative-free nonmonotone direct search methods for unconstrained and box-constrained mixed-integer optimization ⋮ An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables ⋮ 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 method for convex black-box integer global optimization ⋮ Derivative-free optimization methods ⋮ Review and comparison of algorithms and software for mixed-integer derivative-free optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A derivative-free algorithm for linearly constrained optimization problems
- Analysis of direct searches for discontinuous functions
- Penalty function approach for the mixed discrete nonlinear problems by particle swarm optimization
- SO-MI: a surrogate model algorithm for computationally expensive nonlinear mixed-integer black-box global optimization problems
- Derivative-free methods for nonlinear programming with general lower-level constraints
- Extending the QCR method to general mixed-integer programs
- A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
- Implicitly and densely discrete black-box optimization problems
- Simulated annealing with asymptotic convergence for nonlinear constrained optimization
- Incorporating minimum Frobenius norm models in direct search
- Mesh adaptive direct search algorithms for mixed variable optimization
- An adaptive radial basis algorithm (ARBF) for expensive black-box mixed-integer constrained global optimization
- A real coded genetic algorithm for solving integer and mixed integer optimization problems
- Pattern search ranking and selection algorithms for mixed variable simulation-based optimization
- New reflection generator for simulated annealing in mixed-integer/continuous global optimization
- Derivative-free methods for bound constrained mixed-integer optimization
- Solving nonlinearly constrained global optimization problem via an auxiliary function method
- Geometry of interpolation sets in derivative free optimization
- Nonlinear integer programming
- Pattern Search Algorithms for Mixed Variable Programming
- Inexact Restoration Method for Derivative-Free Optimization with Smooth Constraints
- Algorithm 909
- On the Convergence of Pattern Search Algorithms
- Using Sampling and Simplex Derivatives in Pattern Search Methods
- Introduction to Derivative-Free Optimization
- The Tunneling Algorithm for the Global Minimization of Functions
- A Pattern Search Filter Method for Nonlinear Programming without Derivatives
- A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds
- Global Convergence of General Derivative-Free Trust-Region Algorithms to First- and Second-Order Critical Points
- A Progressive Barrier for Derivative-Free Nonlinear Programming
- An Algorithm Model for Mixed Variable Programming
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- Benchmarking optimization software with performance profiles.
- A derivative-free algorithm for bound constrained optimization
This page was built for publication: A trust-region-based derivative free algorithm for mixed integer programming
