ASC
2004
13 years 4 months ago
2004
Global optimization can be used as the main component for reliable decision support systems. In this contribution, we explore numerical solution techniques for nonconvex and nondi...
CCE
2005
13 years 4 months ago
2005
Process network problems can be formulated as Generalized Disjunctive Programs where a logicbased representation is used to deal with the discrete and continuous decisions. A new ...
EOR
2007
13 years 4 months ago
2007
We introduce a master–worker framework for parallel global optimization of computationally expensive functions using response surface models. In particular, we parallelize two r...
INFORMATICALT
2006
13 years 4 months ago
2006
New ways to estimate ranges of values of functions from standard and inner interval arithmetic have been proposed. Using the proposed ways ranges of values of mathematical test fun...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Parallel Global Optimization Algorithms (PGOA) provide an efficient way of dealing with hard optimization problems. One method of parallelization of GOAs that is frequently applie...
GECCO
2008
Springer
13 years 5 months ago
2008
Springer
This paper presents a variant of Quantum behaved Particle Swarm Optimization (QPSO) named Q-QPSO for solving global optimization problems. The Q-QPSO algorithm is based on the cha...
CEC
2010
IEEE
13 years 5 months ago
2010
IEEE
The optimization of spacecraft trajectories can be formulated as a global optimization task. The complexity of the problem depends greatly on the problem formulation, on the spacec...
SIP
2003
2003
Time Domain Optimization Techniques for Blind Separation of Non-stationary Convolutive Mixed Signals
13 years 5 months ago
This paper aims to solve the problem of Blind Signal Separation (BSS) in a convolutive environment based on output correlation matrix diagonalization. Firstly an extension of the ...
DAGSTUHL
2003
13 years 6 months ago
2003
In this article, a solver platform for global optimization is presented, as it is developed in the COCONUT project. After a short
DAGSTUHL
2004
13 years 6 months ago
2004
We consider the global optimization problem for d-variate Lipschitz functions which, in a certain sense, do not increase too slowly in a neighborhood of the global minimizer(s). O...