A trust-region-based derivative free algorithm for mixed integer programming
From MaRDI portal
Publication:2515071
Recommendations
- A trust region SQP algorithm for mixed-integer nonlinear programming
- A trust-region derivative-free algorithm for constrained optimization
- Improved trust-region derivative-free algorithm for general constrained optimization problems
- Derivative-free methods for mixed-integer constrained optimization problems
- A derivative-free trust-region algorithm for composite nonsmooth optimization
- Derivative-free methods for bound constrained mixed-integer optimization
- Inverse Mixed Integer Optimization: Polyhedral Insights and Trust Region Methods
- Derivative-free methods for mixed-integer nonsmooth constrained optimization
- Trust-region algorithms for derivative-free optimization and nonlinear bilevel programming. (Thesis)
- A trust region method for the solution of the surrogate dual in integer programming
Cites work
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- scientific article; zbMATH DE number 1971709 (Why is no real title available?)
- scientific article; zbMATH DE number 2002582 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds
- A Pattern Search Filter Method for Nonlinear Programming without Derivatives
- A derivative-free algorithm for bound constrained optimization
- A derivative-free algorithm for linearly constrained optimization problems
- A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
- A progressive barrier for derivative-free nonlinear programming
- A real coded genetic algorithm for solving integer and mixed integer optimization problems
- Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm
- An Algorithm Model for Mixed Variable Programming
- An adaptive radial basis algorithm (ARBF) for expensive black-box mixed-integer constrained global optimization
- Analysis of direct searches for discontinuous functions
- Benchmarking optimization software with performance profiles.
- Derivative-free methods for bound constrained mixed-integer optimization
- Derivative-free methods for nonlinear programming with general lower-level constraints
- Extending the QCR method to general mixed-integer programs
- Filter pattern search algorithms for mixed variable constrained optimization problems
- Geometry of interpolation sets in derivative free optimization
- Global convergence of general derivative-free trust-region algorithms to first- and second-order critical points
- Implicitly and densely discrete black-box optimization problems
- Incorporating minimum Frobenius norm models in direct search
- Inexact restoration method for derivative-free optimization with smooth constraints
- Introduction to Derivative-Free Optimization
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- Mesh adaptive direct search algorithms for mixed variable optimization
- New reflection generator for simulated annealing in mixed-integer/continuous global optimization
- Nonlinear integer programming
- On the Convergence of Pattern Search Algorithms
- Pattern search algorithms for mixed variable programming
- Pattern search ranking and selection algorithms for mixed variable simulation-based optimization
- 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
- Simulated annealing with asymptotic convergence for nonlinear constrained optimization
- Solving nonlinearly constrained global optimization problem via an auxiliary function method
- The Tunneling Algorithm for the Global Minimization of Functions
- Using Sampling and Simplex Derivatives in Pattern Search Methods
Cited in
(16)- A trust region SQP algorithm for mixed-integer nonlinear programming
- An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables
- Review and comparison of algorithms and software for mixed-integer derivative-free optimization
- Unified approach for solving box-constrained models with continuous or discrete variables by non monotone direct search methods
- Linear transformation based solution methods for non-convex mixed integer quadratic programs
- Derivative-free methods for mixed-integer nonsmooth constrained optimization
- Convergence of derivative-free nonmonotone direct search methods for unconstrained and box-constrained mixed-integer 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
- Sequential linear integer programming for integer optimal control with total variation regularization
- A trust-region framework for derivative-free mixed-integer optimization
- A method for convex black-box integer global optimization
- The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables
- A trajectory-based method for mixed integer nonlinear programming problems
- Derivative-free methods for bound constrained mixed-integer optimization
- Derivative-free optimization methods
This page was built for publication: A trust-region-based derivative free algorithm for mixed integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2515071)
