A class of filled functions for finding global minimizers of a function of several variables
From MaRDI portal
(Redirected from Publication:1077889)
This paper is concerned with the filled function methods for finding global minimizers of a function of several variables. A class of filled functions are defined. The advantages and disadvantages of every filled function in the class are analyzed. The best one in this class is pointed out. The idea of how to construct a better filled function is given and employed to construct the class of filled functions. A method is also explored as how to locate minimizers or saddle points of a filled function only through the use of the gradient of a function.
Recommendations
Cites work
Cited in
(84)- Dynamic globally concavized filled function method for continuous global optimization
- A new filled function method for nonlinear equations
- A cut-peak function method for global optimization
- An efficient algorithm for range computation of polynomials using the Bernstein form
- A parallel global optimization algorithm for rational separable- factorable functions
- A new filled function applied to global optimization.
- The barrier attribute of filled functions.
- Two new classes of filled functions.
- Filled functions for unconstrained global optimization
- Global minimization of nonsmooth constrained global optimization with filled function
- A filled function method dominated by filter for nonlinearly global optimization
- New modified function method for global optimization
- The globally convexized filled functions for global optimization
- A parallel computing scheme for minimizing a class of large scale functions
- A continuous approach to nonlinear integer programming
- The impelling function method applied to global optimization
- Revised filled function methods for global optimization.
- A computable filled function used for global minimization
- Several filled functions with mitigators.
- Modified T-F function method for finding global minimizer on unconstrained optimization
- A new filled function method for constrained nonlinear equations
- The theories of a novel filled function method for non-smooth global optimization
- Filled function method to optimize supply chain transportation costs
- Reservoir computing for forecasting large spatiotemporal dynamical systems
- An efficient algorithm for large scale global optimization of continuous functions
- A filled function method for global optimization
- 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 new filled function for unconstrained global optimization
- A class of augmented filled functions
- A new auxiliary function method for systems of nonlinear equations
- 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
- An approach to solve local and global optimization problems based on exact objective filled penalty functions
- A filled function for seeking global minima
- Test problem generator for unconstrained global optimization
- scientific article; zbMATH DE number 3976227 (Why is no real title available?)
- A continuously differentiable filled function method for global optimization
- A filled function method with one parameter for unconstrained global optimization
- scientific article; zbMATH DE number 567666 (Why is no real title available?)
- scientific article; zbMATH DE number 701596 (Why is no real title available?)
- scientific article; zbMATH DE number 1150467 (Why is no real title available?)
- A new filled function method with two parameters for 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 class of functionals possessing multiple global minima
- A filled function method for quadratic programs with binary constraints†
- A parameter-free filled function for unconstrained 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
- 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
- A new filled function method for unconstrained global optimization
- A class of generalized filled functions with improved computability
- A novel convergent filled function algorithm for multi-dimensional global optimization
- A novel one-parameter filled function method with an application to pathological analysis
- A filled function approach for nonsmooth constrained global optimization
- A new filled function algorithm for constrained global optimization problems
- Finding the roots of system of nonlinear equations by a novel filled function method
- A new parameter-free continuously differentiable filled function algorithm for solving nonlinear equations and data fitting problems
- Identifying a global optimizer with filled function for nonlinear integer programming
- A new class of filled functions with one parameter for global optimization
- A non-parameter filled function method for unconstrained global optimization problems
- A new filled function method applied to unconstrained global optimization
- A novel non-parameter filled function method for unconstrained global optimization
- A class of one-parameter filled functions with the same local minima as the objective function for global optimization problems
- 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
- Parameter-free filled function approach for integer optimization problems
- The filled function transformations for constrained global optimization
- A parameter free filled function for unconstrained 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 finding a global minimizer of a function of several variables
- Finding more and more solutions of a system of nonlinear equations
- Filled function method for nonlinear equations
- A filled function method with one parameter for box constrained global optimization
- A revised cut-peak function method for box constrained continuous global optimization
This page was built for publication: A class of filled functions for finding global minimizers of a function of several variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1077889)
