Discrete filled function method for discrete global optimization
From MaRDI portal
Publication:2487474
DOI10.1007/S10589-005-0985-7zbMATH Open1114.90125DBLPjournals/coap/NgZLT05OpenAlexW2012662720WikidataQ57445505 ScholiaQ57445505MaRDI QIDQ2487474FDOQ2487474
Authors: Weiwen Tian, Chi-Kong Ng, Liansheng Zhang, Duan Li 
Publication date: 5 August 2005
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-005-0985-7
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
nonlinear integer programmingquadratic integer programminglinear integer programmingdiscrete global optimizationdiscrete filled function method
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Integer programming (90C10)
Cites Work
- Testing Unconstrained Optimization Software
- A filled function method for finding a global minimizer of a function of several variables
- Global optimization by controlled random search
- Integral global minimization: Algorithms, implementations and numerical tests
- Global optimality conditions for quadratic optimization problems with binary constraints
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- More test examples for nonlinear programming codes
- Test examples for nonlinear programming codes
- A controlled random search technique incorporating the simulated annealing concept for solving integer and mixed integer global optimization problems
- The Tunneling Algorithm for the Global Minimization of Functions
- Filled functions for unconstrained global optimization.
- A new filled function method for global optimization
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- A class of filled functions for finding global minimizers of a function of several variables
- On Descent from Local Minima
- A continuous approach to nonlinear integer programming
- An approximate algorithm for nonlinear integer programming
- Finding global minima with a computable filled function.
- Title not available (Why is that?)
- Revised filled function methods for global optimization.
- A Survey of Methods for Pure Nonlinear Integer Programming
- A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems
- Nonlinear integer programming for various forms of constraints
- \(p\)th power Lagrangian method for integer programming
- Success guarantee of dual search in integer programming: \(p\)-th power Lagrangian method.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Asymptotic strong duality for bounded integer programming: A logarithmic-exponential dual formulation
Cited In (27)
- 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
- Inflection point-based auxiliary function algorithm for finding global minima of coercive functions
- A discrete filled function algorithm for approximate global solutions of max-cut problems
- 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
- Convergence of derivative-free nonmonotone direct search methods for unconstrained and box-constrained mixed-integer optimization
- Analytical discrete optimization
- 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
- Tracking control of linear switched systems
Uses Software
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)
