A discrete dynamic convexized method for nonlinear integer programming
type: Item
instance of: scholarly article
title: A discrete dynamic convexized method for nonlinear integer programming
zbMATH Open document ID: 1156.65065
published in: Journal of Computational and Applied Mathematics
publication date: 2008-11-20T00:00:00Z
review text: The authors study the nonlinear integer programming problem with arbitrary (not necessarily linear) objective function and constraints. The first two sections present the relevant literature on this problem as well as the necessary definitions and background theorems. The third section presents an auxiliary function that can be used in an algorithm, which is described in the following section, to converge to a solution, while at the same time escape areas of local minimizers by varying the value of a parameter. The algorithm is proven to converge with probability one. In the fifth and last section the authors report the results of the computational experimentation performed using this algorithm. The article concludes with a complete description of the test problems used and a list of useful references.
reviewed by: Efstratios Rappos
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 5370038
zbMATH Keywords: box constrained nonlinear integer programming
zbMATH Keywords: convexized method
zbMATH Keywords: discrete local minimizer
zbMATH Keywords: convergence
zbMATH Keywords: algorithm
author: Wenxing Zhu
author: Howard Fan
MaRDI profile type: Publication
full work available at URL: j.cam.2008.01.023
OpenAlex ID: W1977854849
cites work: On the investigation of stochastic global optimization algorithms
cites work: Using convex envelopes to solve the interactive fixed-charge linear programming problem
cites work: A note on adapting methods for continuous global optimization to the discrete case
cites work: A Monte-Carlo approach for 0-1 programming problems
cites work: An integrated plant loading model with economies of scale and scope
cites work: Q3667913
cites work: An algorithm for indefinite integer quadratic programming
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: The globally convexized filled functions for global optimization
cites work: A Linear Programming Approach to the Cutting Stock Problem—Part II
cites work: Q4739668
cites work: Branch and Bound Experiments in Convex Nonlinear Integer Programming
cites work: A new filled function method for nonlinear integer programming problem
cites work: Methods of Nonlinear 0-1 Programming
cites work: Q5734003
cites work: A branch-and-bound algorithm for bound constrained optimization problems without derivatives
cites work: Q3758561
cites work: Q5733470
cites work: A branch and bound algorithm for solving separable convex integer programming problems
cites work: The Tunneling Algorithm for the Global Minimization of Functions
cites work: On Minimizing Nonseparable Functions Defined on the Integers with an Inventory Application
cites work: An efficient algorithm to solve integer-programming problems arising in system-reliability design
cites work: Q4247439
cites work: A controlled random search technique incorporating the simulated annealing concept for solving integer and mixed integer global optimization problems
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
cites work: Discrete filled function method for discrete global optimization
cites work: Q4524243
cites work: Q4040299
cites work: General local search methods
cites work: A filled function method for finding a global minimizer on global integer optimization
cites work: An exact penalty function approach for nonlinear integer programming problems
cites work: Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
cites work: Q4465182
cites work: An approximate algorithm for nonlinear integer programming
cites work: Calculation of Investment Portfolios with Risk Free Borrowing and Lending
cites work: Q4719183
cites work: Integral global minimization: Algorithms, implementations and numerical tests
cites work: Q4527999
DOI: 10.1016/J.CAM.2008.01.023
description: scientific article; zbMATH DE number 5370038