3049 search results - page 126 / 610 » On the Convergence of Bound Optimization Algorithms |
138
click to vote
COLT
2008
Springer
15 years 6 months ago
2008
Springer
We study on-line decision problems where the set of actions that are available to the decision algorithm vary over time. With a few notable exceptions, such problems remained larg...
136
Voted
ICASSP
2009
IEEE
15 years 11 months ago
2009
IEEE
—We consider constrained minimization of a sum of convex functions over a convex and compact set, when each component function is known only to a specific agent in a timevarying...
128
click to vote
CEC
2005
IEEE
15 years 10 months ago
2005
IEEE
Abstract- Branch-and-Bound and evolutionary algorithms represent two very different approaches for tackling combinatorial optimization problems. These approaches are not incompatib...
118
click to vote
JC
2006
15 years 4 months ago
2006
We study the randomized approximation of weakly singular integral operators. For a suitable class of kernels having a standard type of singularity and being otherwise of finite sm...
146
click to vote
ASC
2004
15 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...