Sciweavers

7519 search results - page 304 / 1504
» Optimizing Generic Functions
Sort
View
CEC
2011
IEEE
14 years 6 months ago
Accelerating convergence towards the optimal pareto front
—Evolutionary algorithms have been very popular optimization methods for a wide variety of applications. However, in spite of their advantages, their computational cost is still ...
Mohsen Davarynejad, Jafar Rezaei, Jos L. M. Vranck...
ISIPTA
2003
IEEE
117views Mathematics» more  ISIPTA 2003»
15 years 12 months ago
Dynamic Programming for Discrete-Time Systems with Uncertain Gain
We generalise the optimisation technique of dynamic programming for discretetime systems with an uncertain gain function. We assume that uncertainty about the gain function is des...
Gert de Cooman, Matthias C. M. Troffaes
CDC
2009
IEEE
107views Control Systems» more  CDC 2009»
15 years 11 months ago
Learning approaches to the Witsenhausen counterexample from a view of potential games
— Since Witsenhausen put forward his remarkable counterexample in 1968, there have been many attempts to develop efficient methods for solving this non-convex functional optimiz...
Na Li, Jason R. Marden, Jeff S. Shamma
JGO
2010
112views more  JGO 2010»
15 years 5 months ago
An information global minimization algorithm using the local improvement technique
In this paper, the global optimization problem with an objective function that is multiextremal that satisfies the Lipschitz condition over a hypercube is considered. An algorithm...
Daniela Lera, Yaroslav D. Sergeyev
ICASSP
2011
IEEE
14 years 10 months ago
Global convergence of independent component analysis based on semidefinite programming relaxation
In the independent component analysis, polynomial functions of higher order statistics are often used as cost functions. However, such cost functions usually have many local minim...
Shotaro Akaho, Jun Fujiki