195 search results - page 7 / 39 » Convergence properties of the cross-entropy method for discr... |
COCOS
2003
Springer
14 years 17 days ago
2003
Springer
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
MOC
1998
13 years 7 months ago
1998
On the basis of a fully discrete trigonometric Galerkin method and two grid iterations we propose solvers for integral and pseudodifferential equations on closed curves which solv...
AI
2011
Springer
12 years 11 months ago
2011
Springer
Probabilistic inference in graphical models is a prevalent task in statistics and artificial intelligence. The ability to perform this inference task efficiently is critical in l...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We study the convergence of Markov Decision Processes made of a large number of objects to optimization problems on ordinary differential equations (ODE). We show that the optimal...
PE
2000
Springer
13 years 7 months ago
2000
Springer
In this paper we study the convergence properties of the power series algorithm, which is a general method to determine (functions of) stationary distributions of Markov chains. W...