Discrete filled function method for discrete global optimization

DOI10.1007/s10589-005-0985-7zbMath1114.90125OpenAlexW2012662720WikidataQ57445505 ScholiaQ57445505MaRDI QIDQ2487474

Weiwen Tian, Lian-Sheng Zhang, Li, Duan, Chi-Kong Ng

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

zbMATH Keywords

nonlinear integer programmingquadratic integer programminglinear integer programmingdiscrete global optimizationdiscrete filled function method

Mathematics Subject Classification ID

Integer programming (90C10) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Related Items

An augmented filled function for global nonlinear integer optimization ⋮ Constrained optimal control of switched systems based on modified BFGS algorithm and filled function method ⋮ Discrete global descent method for discrete global optimization and nonlinear integer programming ⋮ Manifold relaxations for integer programming ⋮ Computational method for optimal control of switched systems with input and state constraints ⋮ Discrete global optimization problems with a modified discrete filled function ⋮ An exact penalty function method for nonlinear mixed discrete programming problems ⋮ Tracking control of linear switched systems ⋮ An auxiliary function method for global minimization in integer programming ⋮ Convergence of derivative-free nonmonotone direct search methods for unconstrained and box-constrained mixed-integer optimization ⋮ A new discrete filled function method for solving large scale max-cut problems ⋮ New tunnel-filled function method for discrete global optimization ⋮ Identifying a global optimizer with filled function for nonlinear integer programming ⋮ A discrete filled function algorithm for approximate global solutions of max-cut problems ⋮ A discrete dynamic convexized method for nonlinear integer programming ⋮ Finding discrete global minima with a filled function for integer programming ⋮ A filled function method for minimizing control variation in constrained discrete-time optimal control problems ⋮ A critical review of discrete filled function methods in solving nonlinear discrete optimization problems ⋮ A filled function method for quadratic programs with binary constraints† ⋮ A modified tunneling function method for non-smooth global optimization and its application in artificial neural network ⋮ A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems ⋮ Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming ⋮ Towards global solutions of optimal discrete-valued control problems

Uses Software

• minpack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A filled function method for finding a global minimizer of a function of several variables
• A class of filled functions for finding global minimizers of a function of several variables
• A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems
• More test examples for nonlinear programming codes
• Test examples for nonlinear programming codes
• Global optimization by controlled random search
• A controlled random search technique incorporating the simulated annealing concept for solving integer and mixed integer global optimization problems
• A continuous approach to nonlinear integer programming
• Revised filled function methods for global optimization.
• Integral global minimization: Algorithms, implementations and numerical tests
• Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
• Asymptotic Strong Duality for Bounded Integer Programming: A Logarithmic-Exponential Dual Formulation
• Nonlinear integer programming for various forms of constraints
• Branch and Bound Experiments in Convex Nonlinear Integer Programming
• The Tunneling Algorithm for the Global Minimization of Functions
• A Survey of Methods for Pure Nonlinear Integer Programming
• Testing Unconstrained Optimization Software
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• On Descent from Local Minima
• An approximate algorithm for nonlinear integer programming
• A new filled function method for global optimization
• Success guarantee of dual search in integer programming: \(p\)-th power Lagrangian method.
• Finding global minima with a computable filled function.
• \(p\)th power Lagrangian method for integer programming
• Filled functions for unconstrained global optimization.