Several filled functions with mitigators.

DOI10.1016/S0096-3003(01)00248-XzbMath1135.90372MaRDI QIDQ1855890

Xian Liu

Publication date: 28 January 2003

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

zbMATH Keywords

Global optimizationNonlinear programmingMinimizationFilled function method

Mathematics Subject Classification ID

Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (13)

A parameter free filled function for unconstrained global optimization ⋮ A novel filled function method and quasi-filled function method for global optimization ⋮ MEEF: A minimum-elimination-escape function method for multimodal optimization problems ⋮ Non parameter-filled function for global optimization ⋮ Global minimization of non-smooth unconstrained problems with filled function ⋮ The barrier attribute of filled functions. ⋮ Two new classes of filled functions. ⋮ Finding discrete global minima with a filled function for integer programming ⋮ Global descent methods for unconstrained global optimization ⋮ A new filled function for unconstrained global optimization ⋮ A class of augmented filled functions ⋮ Globally concavized filled function method for the box constrained continuous global minimization problem ⋮ The impelling function method applied to global optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A filled function method for finding a global minimizer of a function of several variables
• A class of filled functions for finding global minimizers of a function of several variables
• A multi-start global minimization algorithm with dynamic search trajectories
• A computable filled function used for global minimization
• Widely Convergent Method for Finding Multiple Solutions of Simultaneous Nonlinear Equations
• Limiting Distribution for Random Optimization Methods
• An algorithm for finding the global maximum of a multimodal, multivariate function
• Global optimization of functions by the random optimization method
• Iterative Methods for the Localization of the Global Maximum
• Cluster Analysis Using Seed Points and Density-Determined Hyperspheres as an Aid to Global Optimization
• An efficient method for finding the minimum of a function of several variables without calculating derivatives
• Global optimization

This page was built for publication: Several filled functions with mitigators.