Discrete filled function method for discrete global optimization
From MaRDI portal
Recommendations
- A new discrete filled function algorithm for discrete global optimization
- Discrete global optimization problems with a modified discrete filled function
- Modified filled function method for global discrete optimization
- A critical review of discrete filled function methods in solving nonlinear discrete optimization problems
- An augmented filled function for global nonlinear integer optimization
Cites work
- scientific article; zbMATH DE number 3821078 (Why is no real title available?)
- scientific article; zbMATH DE number 1795208 (Why is no real title available?)
- scientific article; zbMATH DE number 1383429 (Why is no real title available?)
- A Survey of Methods for Pure Nonlinear Integer Programming
- A class of filled functions for finding global minimizers of a function of several variables
- A continuous approach to nonlinear integer programming
- A controlled random search technique incorporating the simulated annealing concept for solving integer and mixed integer global optimization problems
- A filled function method for finding a global minimizer of a function of several variables
- A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems
- A new filled function method for global optimization
- An approximate algorithm for nonlinear integer programming
- Asymptotic strong duality for bounded integer programming: A logarithmic-exponential dual formulation
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- Filled functions for unconstrained global optimization.
- Finding global minima with a computable filled function.
- Global optimality conditions for quadratic optimization problems with binary constraints
- Global optimization by controlled random search
- Integral global minimization: Algorithms, implementations and numerical tests
- More test examples for nonlinear programming codes
- Nonlinear integer programming for various forms of constraints
- On Descent from Local Minima
- Revised filled function methods for global optimization.
- Success guarantee of dual search in integer programming: p-th power Lagrangian method.
- Test examples for nonlinear programming codes
- Testing Unconstrained Optimization Software
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The Tunneling Algorithm for the Global Minimization of Functions
- pth power Lagrangian method for integer programming
Cited in
(28)- Tracking control of linear switched systems
- An augmented filled function for global nonlinear integer optimization
- An auxiliary function method for global minimization in integer programming
- A critical review of discrete filled function methods in solving nonlinear discrete optimization problems
- Modified filled function method for global discrete optimization
- A discrete filled function algorithm for approximate global solutions of max-cut problems
- Inflection point-based auxiliary function algorithm for finding global minima of coercive functions
- Computational method for optimal control of switched systems with input and state constraints
- A new discrete filled function algorithm for discrete global optimization
- Discrete global descent method for discrete global optimization and nonlinear integer programming
- A filled function method for minimizing control variation in constrained discrete-time optimal control problems
- A new discrete filled function method for solving large scale max-cut problems
- A modified tunneling function method for non-smooth global optimization and its application in artificial neural network
- Towards global solutions of optimal discrete-valued control problems
- Analytical discrete optimization
- Convergence of derivative-free nonmonotone direct search methods for unconstrained and box-constrained mixed-integer optimization
- Lower semi-continuous augmented function for global optimization problems
- Discrete global optimization problems with a modified discrete filled function
- A discrete dynamic convexized method for nonlinear integer programming
- Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming
- Finding discrete global minima with a filled function for integer programming
- A filled function method for quadratic programs with binary constraints†
- Constrained optimal control of switched systems based on modified BFGS algorithm and filled function method
- A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems
- Identifying a global optimizer with filled function for nonlinear integer programming
- Manifold relaxations for integer programming
- An exact penalty function method for nonlinear mixed discrete programming problems
- New tunnel-filled function method for discrete global optimization
This page was built for publication: Discrete filled function method for discrete global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2487474)
