Discrete global descent method for discrete global optimization and nonlinear integer programming

DOI10.1007/s10898-006-9053-9zbMath1156.90006OpenAlexW2076640191WikidataQ57445484 ScholiaQ57445484MaRDI QIDQ878221

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

Publication date: 26 April 2007

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-006-9053-9

zbMATH Keywords

Integer programmingDiscrete global descent methodDiscrete global optimizationNonlinear integer programming

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (15)

An augmented filled function for global nonlinear integer optimization ⋮ Discrete global optimization problems with a modified discrete filled function ⋮ A novel convergent filled function algorithm for multi-dimensional global optimization ⋮ 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 ⋮ New tunnel-filled function method for discrete global optimization ⋮ Parameter-free filled function method for nonlinear integer program ⋮ Identifying a global optimizer with filled function for nonlinear integer programming ⋮ Finding discrete global minima with a filled function for integer programming ⋮ A critical review of discrete filled function methods in solving nonlinear discrete optimization problems ⋮ Minimal infeasible constraint sets in convex integer programs ⋮ A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems ⋮ Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming ⋮ A note on ``A continuous approach to nonlinear integer programming ⋮ Towards global solutions of optimal discrete-valued control problems

Uses Software

• minpack

Cites Work

• 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
• A controlled random search technique incorporating the simulated annealing concept for solving integer and mixed integer global optimization problems
• A new filled function applied to global optimization.
• A continuous approach to nonlinear integer programming
• Integral global minimization: Algorithms, implementations and numerical tests
• Discrete filled function method for discrete global optimization
• Nonlinear integer programming
• Asymptotic Strong Duality for Bounded Integer Programming: A Logarithmic-Exponential Dual Formulation
• Branch and Bound Experiments in Convex 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.

This page was built for publication: Discrete global descent method for discrete global optimization and nonlinear integer programming