Revised filled function methods for global optimization.

DOI10.1016/S0096-3003(99)00266-0zbMath1053.90111MaRDI QIDQ1854956

Qiaoming Han, Ji-ye Han

Publication date: 28 January 2003

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

zbMATH Keywords

Global minimizer; Local minimizer; The filled function method

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

Related Items

A parameter-free filled function for unconstrained global optimization, A gradually descent method for discrete global optimization, Globally concavized filled function method for the box constrained continuous global minimization problem, A new filled function method for unconstrained global optimization, An integral function and vector sequence method for unconstrained global optimization, A one-parameter filled function for nonsmooth global optimization and its application, Unification of filled function and tunnelling function in global optimization, A integral filter algorithm for unconstrained global optimization, New filled functions for nonsmooth global optimization, Simple transformation functions for finding better minima, Discrete filled function method for discrete global optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A filled function method for finding a global minimizer of a function of several variables
• Finding more and more solutions of a system of nonlinear equations
• A class of filled functions for finding global minimizers of a function of several variables
• The globally convexized filled functions for global optimization
• Generalized Simulated Annealing for Function Optimization
• On Descent from Local Minima