Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming

Authors:
Wenxing Zhu;M. M. Ali
Affiliations:
Center for Discrete Mathematics and Theoretical Computer Science, Fuzhou University, Fuzhou 350002, China;School of Computational and Applied Mathematics, University of the Witwatersrand, Wits 2050, South Africa
Venue:
Computers and Operations Research
Year:
2009

Citing 8
Cited 2

A note on adapting methods for continuous global optimization to the discrete case

Annals of Operations Research
A Monte-Carlo approach for 0–1 programming problems

Computing
A branch and bound algorithm for solving separable convex integer programming problems

Computers and Operations Research
An approximate algorithm for nonlinear integer programming

Applied Mathematics and Computation
A Controlled Random Search Technique Incorporating the Simulated Annealing Concept for Solving Integer and Mixed Integer Global Optimization Problems

Computational Optimization and Applications
Discrete Filled Function Method for Discrete Global Optimization

Computational Optimization and Applications
Discrete global descent method for discrete global optimization and nonlinear integer programming

Journal of Global Optimization
A discrete dynamic convexized method for nonlinear integer programming

Journal of Computational and Applied Mathematics

A dynamic convexized method for nonconvex mixed integer nonlinear programming

Computers and Operations Research
Max-k-Cut by the Discrete Dynamic Convexized Method

INFORMS Journal on Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper considers the nonlinearly constrained nonlinear integer programming problem over a bounded box. An auxiliary function is constructed based on a penalty function. By increasing the value of a parameter, minimization of the function by a discrete local search method can escape successfully from a previously converged discrete local minimizer. An algorithm is designed based on minimizing the auxiliary function with increasing values of the parameter. Numerical experiments show that the algorithm is robust and efficient.