Finding global minimizer with one-parameter filled function on unconstrained global optimization
From MaRDI portal
Recommendations
- Publication:3054927
- A filled function method with one parameter for unconstrained global optimization
- A one-parameter filled function method for unconstrained global optimization problems with continuous variables
- Publication:4640814
- A filled function algorithm for unconstrained global optimization problems
Cites work
- A class of generalized filled functions with improved computability
- A filled function method for finding a global minimizer of a function of several variables
- A filled function method for finding a global minimizer on global integer optimization
- A new filled function method for global optimization
- A new filled function method for unconstrained global optimization
- Filled functions for unconstrained global optimization.
- Finding global minima with a computable filled function.
- The globally convexized filled functions for global optimization
Cited in
(16)- A new filled function method for unconstrained global optimization
- Polynomial-filled function algorithm for unconstrained global optimization problems
- A new parameter free filled function for solving unconstrained global optimization problems
- A filled function method with one parameter for unconstrained global optimization
- A filled function approach for nonsmooth constrained global optimization
- A new filled function for global minimization and system of nonlinear equations
- A novel convergent filled function algorithm for multi-dimensional global optimization
- A new filled function method applied to unconstrained global optimization
- A one-parameter filled function method for unconstrained global optimization problems with continuous variables
- Finding global minima with an inflection point-based filled function algorithm
- A new parameter-free continuously differentiable filled function algorithm for solving nonlinear equations and data fitting problems
- New filled functions for nonsmooth global optimization
- A new filled function algorithm for constrained global optimization problems
- Modified Filled Function Method for Resolving Nonlinear Integer Programming Problem
- MEEF: A minimum-elimination-escape function method for multimodal optimization problems
- A novel one-parameter filled function method with an application to pathological analysis
This page was built for publication: Finding global minimizer with one-parameter filled function on unconstrained global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q990416)