368 search results - page 27 / 74 » Some new iterative methods with three-order convergence |
ICML
2003
IEEE
14 years 8 months ago
2003
IEEE
We study a class of overrelaxed bound optimization algorithms, and their relationship to standard bound optimizers, such as ExpectationMaximization, Iterative Scaling, CCCP and No...
SIAMJO
2002
13 years 7 months ago
2002
Most local convergence analyses of the sequential quadratic programming (SQP) algorithm for nonlinear programming make strong assumptions about the solution, namely, that the activ...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
—We propose a dynamic spectrum access scheme where secondary users recommend “good” channels to each other and access accordingly. We formulate the problem as an average rewa...
ICDM
2006
IEEE
14 years 1 months ago
2006
IEEE
The k-means algorithm is a popular clustering method used in many different fields of computer science, such as data mining, machine learning and information retrieval. However, ...
ISPD
1997
ACM
13 years 11 months ago
1997
ACM
A linear wirelength objective more e ectively captures timing, congestion, and other global placement considerations than a squared wirelength objective. The GORDIAN-L cell placem...