A new filled function applied to global optimization.
From MaRDI portal
Publication:1422382
DOI10.1016/S0305-0548(02)00154-5zbMath1039.90099OpenAlexW2009458683MaRDI QIDQ1422382
Publication date: 14 February 2004
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(02)00154-5
Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (25)
A new parameter free filled function for solving unconstrained global optimization problems ⋮ A parameter free filled function for unconstrained global optimization ⋮ A new filled function for global minimization and system of nonlinear equations ⋮ MEEF: A minimum-elimination-escape function method for multimodal optimization problems ⋮ On the utility of randomly generated functions for performance evaluation of evolutionary algorithms ⋮ Discrete global descent method for discrete global optimization and nonlinear integer programming ⋮ A filled function approach for nonsmooth constrained global optimization ⋮ Discrete global optimization problems with a modified discrete filled function ⋮ A continuously differentiable filled function method for global optimization ⋮ Finding global minima with an inflection point-based filled function algorithm ⋮ A New Hybrid Optimization Algorithm for the Estimation of Archie Parameters ⋮ A filled function method with one parameter for unconstrained global optimization ⋮ Finding the roots of system of nonlinear equations by a novel filled function method ⋮ A new “Optimization‐Preserving‐Operator” applied to global optimization ⋮ Alienor method applied to operational research ⋮ A direct search algorithm for global optimization ⋮ A new filled function method for unconstrained global optimization ⋮ A new constructing auxiliary function method for global optimization ⋮ A combined global \& local search (CGLS) approach to global optimization ⋮ A revised cut-peak function method for box constrained continuous global optimization ⋮ A new auxiliary function method for systems of nonlinear equations ⋮ Dynamic globally concavized filled function method for continuous global optimization ⋮ A cut-peak function method for global optimization ⋮ Globally concavized filled function method for the box constrained continuous global minimization problem ⋮ Finding global minima with a novel filled function for non-smooth unconstrained optimisation
Cites Work
- Unnamed Item
- 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
- The globally convexized filled functions for global optimization
- 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
- 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
- Global optimization
This page was built for publication: A new filled function applied to global optimization.