Discrete global descent method for discrete global optimization and nonlinear integer programming
type: Item
instance of: scholarly article
title: Discrete global descent method for discrete global optimization and nonlinear integer programming
zbMATH Open document ID: 1156.90006
author: Chi-Kong Ng
author: Duan Li
author: Liansheng Zhang
published in: Journal of Global Optimization
publication date: 2007-04-26T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5146234
zbMATH Keywords: Discrete global descent method
zbMATH Keywords: Discrete global optimization
zbMATH Keywords: Nonlinear integer programming
zbMATH Keywords: Integer programming
Wikidata QID: Q57445484
describes a project that uses: minpack
MaRDI profile type: Publication
full work available at URL: s10898-006-9053-9
OpenAlex ID: W2076640191
cites work: Q3667913
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: A filled function method for finding a global minimizer of a function of several variables
cites work: A continuous approach to nonlinear integer programming
cites work: A class of filled functions for finding global minimizers of a function of several variables
cites work: On Descent from Local Minima
cites work: Branch and Bound Experiments in Convex Nonlinear Integer Programming
cites work: Test examples for nonlinear programming codes
cites work: A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems
cites work: Success guarantee of dual search in integer programming: \(p\)-th power Lagrangian method.
cites work: Nonlinear integer programming
cites work: \(p\)th power Lagrangian method for integer programming
cites work: Finding global minima with a computable filled function.
cites work: A new filled function applied to global optimization.
cites work: A controlled random search technique incorporating the simulated annealing concept for solving integer and mixed integer global optimization problems
cites work: Testing Unconstrained Optimization Software
cites work: Discrete filled function method for discrete global optimization
cites work: More test examples for nonlinear programming codes
cites work: Asymptotic strong duality for bounded integer programming: A logarithmic-exponential dual formulation
cites work: Filled functions for unconstrained global optimization.
cites work: Q4719183
cites work: A new filled function method for global optimization
cites work: Integral global minimization: Algorithms, implementations and numerical tests
cites work: An approximate algorithm for nonlinear integer programming
DOI: 10.1007/S10898-006-9053-9
description: scientific article; zbMATH DE number 5146234