Sciweavers

866 search results - page 12 / 174
» Extension of the direct optimization algorithm for noisy fun...
Sort
View
AUTOMATICA
2007
102views more  AUTOMATICA 2007»
13 years 6 months ago
An extension of duality to a game-theoretic framework
This paper extends some duality results from a standard optimization setup to a noncooperative (Nash) game framework. A Nash game (NG) with coupled constraints is considered. Solv...
Lacra Pavel
ICML
2001
IEEE
14 years 7 months ago
Direct Policy Search using Paired Statistical Tests
Direct policy search is a practical way to solve reinforcement learning problems involving continuous state and action spaces. The goal becomes finding policy parameters that maxi...
Malcolm J. A. Strens, Andrew W. Moore
SIAMJO
2011
13 years 1 months ago
Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
Many applications arising in a variety of fields can be well illustrated by the task of recovering the low-rank and sparse components of a given matrix. Recently, it is discovered...
Min Tao, Xiaoming Yuan
GECCO
2007
Springer
155views Optimization» more  GECCO 2007»
14 years 26 days ago
Towards billion-bit optimization via a parallel estimation of distribution algorithm
This paper presents a highly efficient, fully parallelized implementation of the compact genetic algorithm (cGA) to solve very large scale problems with millions to billions of va...
Kumara Sastry, David E. Goldberg, Xavier Llor&agra...
NC
2002
210views Neural Networks» more  NC 2002»
13 years 6 months ago
Recent approaches to global optimization problems through Particle Swarm Optimization
This paper presents an overview of our most recent results concerning the Particle Swarm Optimization (PSO) method. Techniques for the alleviation of local minima, and for detectin...
Konstantinos E. Parsopoulos, Michael N. Vrahatis