3049 search results - page 252 / 610 » On the Convergence of Bound Optimization Algorithms |
161
click to vote
TSMC
2002
15 years 6 months ago
2002
The fastest learning automata (LA) algorithms currently available fall in the family of estimator algorithms introduced by Thathachar and Sastry [24]. The pioneering work of these ...
169
click to vote
3DIM
2007
IEEE
16 years 28 days ago
2007
IEEE
We describe a variation of the iterative closest point (ICP) algorithm for aligning two point sets under a set of transformations. Our algorithm is superior to previous algorithms...
223
click to vote
ANTSW
2004
Springer
15 years 12 months ago
2004
Springer
A general-purpose, simulation-based algorithm S-ACO for solving stochastic combinatorial optimization problems by means of the ant colony optimization (ACO) paradigm is investigate...
208
click to vote
SIAMJO
2011
15 years 1 months ago
2011
We present a class of inexact adaptive multilevel trust-region SQP-methods for the efficient solution of optimization problems governed by nonlinear partial differential equations...
175
click to vote
MOR
2006
15 years 6 months ago
2006
We apply the method known as simulated annealing to the following problem in convex optimization: minimize a linear function over an arbitrary convex set, where the convex set is ...