74 search results - page 6 / 15 » Optimal robust expensive optimization is tractable |
CEC
2011
IEEE
12 years 8 months ago
2011
IEEE
— The principle of artificial curiosity directs active exploration towards the most informative or most interesting data. We show its usefulness for global black box optimizatio...
JCC
2010
13 years 7 months ago
2010
: Finding the rotational matrix that minimizes the sum of squared deviations between two vectors is an important problem in bioinformatics and crystallography. Traditional algorith...
IPPS
2010
IEEE
13 years 6 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
AUTOMATICA
2008
13 years 8 months ago
2008
A wide variety of stability and performance questions about linear dynamical systems can be reformulated as convex optimization problems involving linear matrix inequalities (LMIs...
CDC
2008
IEEE
14 years 3 months ago
2008
IEEE
Abstract— Attenuation of sinusoidal disturbances with uncertain and arbitrarily time-varying frequencies is considered in the form of a generalized asymptotic regulation problem....