Finding global minima with a computable filled function.
From MaRDI portal
Recommendations
Cited in
(55)- Dynamic globally concavized filled function method for continuous global optimization
- A new filled function method for nonlinear equations
- New modified function method for global optimization
- A computable filled function used for global minimization
- A new filled function method for constrained nonlinear equations
- A filled function which has the same local minimizer of the objective function
- A filled function method for global optimization
- A filled function method for nonlinear equations
- Simple transformation functions for finding better minima
- Finding discrete global minima with a filled function for integer programming
- Discrete filled function method for discrete global optimization
- A smoothing method of global optimization that preserves global minima
- A class of augmented filled functions
- A criterion for an approximation global optimal solution based on the filled functions
- A class of filled functions for box constrained continuous global optimization
- Non parameter-filled function for global optimization
- Finding global minima with an inflection point-based filled function algorithm
- Parameter-free filled function method for nonlinear integer program
- A new discrete filled function method for solving large scale max-cut problems
- An efficient dynamical evolutionary algorithm for global optimization
- A new filled function method with two parameters for global optimization
- A new auxiliary function method for general constrained global optimization
- 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 Class of Parameter-Free Filled Functions for Unconstrained Global Optimization
- A parameter-free filled function for unconstrained global optimization
- Globally concavized filled function method for the box constrained continuous global minimization problem
- Global descent methods for unconstrained global optimization
- A new filled function method for unconstrained global optimization
- A new filled function method for unconstrained global optimization
- A class of generalized filled functions with improved computability
- A novel one-parameter filled function method with an application to pathological analysis
- A multi dynamics algorithm for global optimization
- Subset simulation for unconstrained global optimization
- Inflection point-based auxiliary function algorithm for finding global minima of coercive functions
- A new parameter-free continuously differentiable filled function algorithm for solving nonlinear equations and data fitting problems
- A class of non-limiting factor filling functions for global minimization
- A new filled function method applied to unconstrained global optimization
- A novel parameter-free filled function method for global optimization and solving nonlinear equation systems
- A class of one-parameter filled functions with the same local minima as the objective function for global optimization problems
- A novel single-parameter continuously differentiable filled function for global optimization
- An efficient algorithm via a novel one-parameter filled function based on general univariate functions for unconstrained global optimization
- A new filled function for global optimization
- A new class of filled functions with two parameters for solving unconstrained global optimization problems
- Lower semi-continuous augmented function for global optimization problems
- A filled function method for global optimization with inequality constraints
- A novel filled function method and quasi-filled function method for global optimization
- Unification of filled function and tunnelling function in global optimization
- Discrete global descent method for discrete global optimization and nonlinear integer programming
- Discrete global optimization problems with a modified discrete filled function
- A filled function method for constrained global optimization
- A discrete filled function algorithm for approximate global solutions of max-cut problems
- Filled function method for nonlinear equations
- Finding global minimizer with one-parameter filled function on unconstrained global optimization
- A revised cut-peak function method for box constrained continuous global optimization
This page was built for publication: Finding global minima with a computable filled function.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5929390)
