A class of filled functions for finding global minimizers of several variables
Journal of Optimization Theory and Applications
A filled function method for finding a global minimizer of a function of several variables
Mathematical Programming: Series A and B
The globally convexized filled functions for global optimization
Applied Mathematics and Computation
Introduction to Global Optimization (Nonconvex Optimization and Its Applications)
Introduction to Global Optimization (Nonconvex Optimization and Its Applications)
A New Filled Function Method for Global Optimization
Journal of Global Optimization
A Hybrid Descent Method for Global Optimization
Journal of Global Optimization
Discrete Filled Function Method for Discrete Global Optimization
Computational Optimization and Applications
A Class of Augmented Filled Functions
Computational Optimization and Applications
A Novel Filled Function Method and Quasi-Filled Function Method for Global Optimization
Computational Optimization and Applications
Discrete global descent method for discrete global optimization and nonlinear integer programming
Journal of Global Optimization
A filled function method for global optimization
Journal of Computational and Applied Mathematics
A hybrid global optimisation algorithm based on locally filled functions and cluster analysis
International Journal of Computational Science and Engineering
A discrete filled function algorithm for approximate global solutions of max-cut problems
Journal of Computational and Applied Mathematics
A new filled function method for unconstrained global optimization
Journal of Computational and Applied Mathematics
A review of recent advances in global optimization
Journal of Global Optimization
Filled function method for nonlinear equations
Journal of Computational and Applied Mathematics
Global descent methods for unconstrained global optimization
Journal of Global Optimization
A new class of filled functions with one parameter for global optimization
Computers & Mathematics with Applications
Global Descent Method for Global Optimization
SIAM Journal on Optimization
A new class of filled functions for global minimization
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
A new discrete filled function method for solving large scale max-cut problems
Numerical Algorithms
Hi-index | 0.00 |
This paper is concerned with filled function techniques for unconstrained global minimization of a continuous function of several variables. More general forms of filled functions are presented for smooth and non-smooth optimization problems. These functions have either one or two adjustable parameters. Conditions on functions and on the values of parameters are given so that the constructed functions have the desired properties of filled functions.