Results 271 to 280 of about 286,749 (305)
Some of the next articles are maybe not open access.
Interval methods for global optimization
Applied Mathematics and Computation, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
DIVANU: A new method for global optimization
International Journal of Bio-Medical Computing, 1995We propose a new method, DIVANU (Diminution of Variables Number), for numerically solving minimization problems involving any function of any variables. This method uses a reducing transformation. We have used this method for applications to biological problems. The identification of models is treated.
O, Bendiab, Y, Cherruault
openaire +2 more sources
Enhancing PSO methods for global optimization
Applied Mathematics and Computation, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ioannis G. Tsoulos +1 more
openaire +2 more sources
Stochastic Methods for Practical Global Optimization
Journal of Global Optimization, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Parallel MCMC methods for global optimization
Monte Carlo Methods and Applications, 2019Abstract We introduce a parallel scheme for simulated annealing, a widely used Markov chain Monte Carlo (MCMC) method for optimization. Our method is constructed and analyzed under the classical framework of MCMC. The benchmark function for optimization is used for validation and verification of the parallel scheme.
Lihao Zhang, Zeyang Ye, Yuefan Deng
openaire +2 more sources
On a Method of Global Optimization
2003The usual optimization problem, in eventually introducing some further new variables, may be put in the following form: Optimization Problem O.
openaire +1 more source
Global optimization method for cluster structures
Physical Review E, 2008A time-going-backward quasidynamics method is developed for global optimization of cluster structures, and its merits are examined by a simple classical mechanics model, indicating that the probability for the system to jump over high potential barriers by this method is much higher than that by common annealing methods.
Yin, Wang, Jun, Zhuang, Xi-Jing, Ning
openaire +2 more sources
1991
According to the classification of Section 1.2.2 this chapter describes some principal approaches and methods of global optimization except the global random search methods which Part 2 is devoted to. We shall consider the minimization of the objective function f (belonging to a given functional set F and evaluated without a noise) on the feasible ...
Anatoly A. Zhigljavsky, J. Pintér
openaire +1 more source
According to the classification of Section 1.2.2 this chapter describes some principal approaches and methods of global optimization except the global random search methods which Part 2 is devoted to. We shall consider the minimization of the objective function f (belonging to a given functional set F and evaluated without a noise) on the feasible ...
Anatoly A. Zhigljavsky, J. Pintér
openaire +1 more source
An interval arithmetic method for global optimization
Computing, 1979An interval arithmetic method is described for finding the global maxima or minima of multivariable functions. The original domain of variables is divided successively, and the lower and the upper bounds of the interval expression of the function are estimated on each subregion.
Kozo Ichida, Yasuo Fujii
openaire +2 more sources
A hybrid heuristic method for global optimization
Fifth International Conference on Hybrid Intelligent Systems (HIS'05), 2005In this paper a new stochastic hybrid technique for unconstrained global optimization (GO) is proposed. It is a combination of an iterative algorithm developed by us (called LP/sub /spl tau//O) that uses low-discrepancy sequences of points and heuristic knowledge to find regions of attraction when searching for a global minimum (GM) and the well-known ...
Antoniya Georgieva, Ivan Jordanov
openaire +1 more source