A filled function method for global optimization with inequality constraints
- 23 December 2016
- journal article
- research article
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 37 (2) , 1524-1536
Abstract
No abstract availableKeywords
Funding Information
- the National Nature Science Foundation of China (11161001, 61203372)
- the Research Foundation of Jinling Institute of Technology (jit-b-201314, jit-n-201309)
This publication has 21 references indexed in Scilit:
- A continuously differentiable filled function method for global optimizationNumerical Algorithms, 2013
- A new filled function algorithm for constrained global optimization problemsApplied Mathematics and Computation, 2011
- A deterministic annealing algorithm for approximating a solution of the min-bisection problemNeural Networks, 2009
- An orthogonal genetic algorithm with quantization for global numerical optimizationIEEE Transactions on Evolutionary Computation, 2001
- Multiobjective programming using uniform design and genetic algorithmIEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews), 2000
- A Collection of Test Problems for Constrained Global Optimization Algorithms1990
- A filled function method for finding a global minimizer of a function of several variablesMathematical Programming, 1990
- The Tunneling Algorithm for the Global Minimization of FunctionsSIAM Journal on Scientific and Statistical Computing, 1985
- Iterative Methods for the Localization of the Global MaximumSIAM Journal on Numerical Analysis, 1982
- Widely Convergent Method for Finding Multiple Solutions of Simultaneous Nonlinear EquationsIBM Journal of Research and Development, 1972