Revised filled function methods for global optimization.

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

Qiaoming Han, Ji-ye Han

Publication date: 28 January 2003

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

Full work available at URL: https://doi.org/10.1016/s0096-3003(99)00266-0

zbMATH Keywords

Global minimizerLocal minimizerThe filled function method

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items (12)

A parameter-free filled function for unconstrained global optimization ⋮ Unification of filled function and tunnelling function in global optimization ⋮ A integral filter algorithm for unconstrained global optimization ⋮ Simple transformation functions for finding better minima ⋮ A direct search algorithm for global optimization ⋮ New filled functions for nonsmooth 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 ⋮ Discrete filled function method for discrete global optimization ⋮ A new filled function method 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

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

This page was built for publication: Revised filled function methods for global optimization.