Book Chapter10.1007/978-3-319-08377-3_7
Modified Filled Function Method for Global Discrete Optimization
You-Lin Shang,Zhen-Yang Sun,Xiang-Yi Jiang +2 more
- 01 Jan 2015
- pp 57-68
TL;DR: The properties of the proposed filled function and the method using this filled function to solve discrete nonlinear programming problem are discussed and the results of preliminary numerical experiments are reported.
read more
Abstract: We present a modified definition of the filled function for discrete nonlinear programming problem and give a filled function satisfying our definition. The properties of the proposed filled function and the method using this filled function to solve discrete nonlinear programming problem are discussed in this paper. The results of preliminary numerical experiments are also reported.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
References
A filled function method for finding a global minimizer of a function of several variables
TL;DR: An algorithm for global minimization is generated based on the concept and properties of the filled function and computational results show that in most cases this algorithm works better than the tunneling algorithm.
336
The globally convexized filled functions for global optimization
Renpu Ge,Yongfeng Qin +1 more
TL;DR: In this article, a new filled function, the globally convexized filled function (GFFL), is proposed, where the value tends to positive infinity as the norm of the variable vector tends to infinity, and it has no stationary point in the region in which the objective function value is greater than or equal to the least value found so far, but it does have a minimizer with a prefixed minimizer.
102
A continuous approach to nonlinear integer programming
Renpu Ge,Changbin Huang +1 more
TL;DR: This paper is concerned with nonlinear integer programming problems- unconstrained and constrained as well as mixed - transformed into nonlinear global optimization problems and then solved by the filled function transformation method.
56
Continuity Methods for Nonlinear Integer Programming
Liansheng Z,Yirong Y +1 more
- 01 Jan 1998
TL;DR: The methods by which either unconstrained or constrained nonlinear integer-programming can be converted into nonlinear continous programming are given.
6