A discrete dynamic convexized method for nonlinear integer programming

@inproceedings{Zhu2008ADD,
  title={A discrete dynamic convexized method for nonlinear integer programming},
  author={Wenxing Zhu and Hong Fan},
  year={2008}
}
In this paper, we consider the box constrained nonlinear integer programming problem. We present an auxiliary function, which has the same discrete global minimizers as the problem. The minimization of the function using a discrete local search method can escape successfully from previously converged discrete local minimizers by taking increasing values of a parameter. We propose an algorithm to find a global minimizer of the box constrained nonlinear integer programming problem. The algorithm… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 42 references

L

  • C. Ng
  • Zhang, et al., Discrete filled function method…
  • 2005
Highly Influential
5 Excerpts

An algorithm for finding global minimum of nonlinear integer programming

  • W. Tian, L. Zhang
  • Journal of Computational Mathematics 22 (1) (2004…
  • 2009
1 Excerpt

A filled function method for finding a global minimizer on global integer optimization

  • Y. Shang, L. Zhang
  • Journal of Computational and Applied Mathematics…
  • 2005
1 Excerpt

A filled function method for integer programming

  • W. X. Zhu
  • Acta Mathematicae Applicatae Sinica 23 (4)
  • 2000
1 Excerpt

Similar Papers

Loading similar papers…