A new filled function for unconstrained global optimization
From MaRDI portal
Publication:2490220
DOI10.1016/j.amc.2005.05.009zbMath1120.90042OpenAlexW2029376181MaRDI QIDQ2490220
Publication date: 28 April 2006
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2005.05.009
Related Items
A new parameter free filled function for solving unconstrained global optimization problems ⋮ A new filled function for global minimization and system of nonlinear equations ⋮ A continuously differentiable filled function method for global optimization ⋮ A filled function method with one parameter for unconstrained global optimization ⋮ A level-value estimation method and stochastic implementation for global optimization ⋮ A new constructing auxiliary function method for global optimization ⋮ Finding global minima with a filled function approach for non-smooth global optimization ⋮ A filled function method with one parameter for box constrained 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
- 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 sequential convexification method (SCM) for continuous global optimization
- Several filled functions with mitigators.
- Widely Convergent Method for Finding Multiple Solutions of Simultaneous Nonlinear Equations
- Limiting Distribution for Random Optimization Methods
- The Tunneling Algorithm for the Global Minimization of Functions
- 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
- A new filled function method for global optimization
- Filled functions for unconstrained global optimization.
- A class of generalized filled functions with improved computability