Sciweavers

1997 search results - page 96 / 400
» On the convergence of Hill's method
Sort
View
NIPS
2007
15 years 7 months ago
Adaptive Embedded Subgraph Algorithms using Walk-Sum Analysis
We consider the estimation problem in Gaussian graphical models with arbitrary structure. We analyze the Embedded Trees algorithm, which solves a sequence of problems on tractable...
Venkat Chandrasekaran, Jason K. Johnson, Alan S. W...
MOR
2008
110views more  MOR 2008»
15 years 6 months ago
Alternating Projections on Manifolds
We prove that if two smooth manifolds intersect transversally, then the method of alternating projections converges locally at a linear rate. We bound the speed of convergence in ...
Adrian S. Lewis, Jérôme Malick
SIAMJO
2008
141views more  SIAMJO 2008»
15 years 6 months ago
Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
It is known that the Karush-Kuhn-Tucker (KKT) conditions of semidefinite programming can be reformulated as a nonsmooth system via the metric projector over the cone of symmetric ...
Zi Xian Chan, Defeng Sun
TOG
2012
271views Communications» more  TOG 2012»
13 years 8 months ago
Mass splitting for jitter-free parallel rigid body simulation
We present a parallel iterative rigid body solver that avoids common artifacts at low iteration counts. In large or real-time simulations, iteration is often terminated before con...
Richard Tonge, Feodor Benevolenski, Andrey Voroshi...
JMLR
2012
13 years 8 months ago
Age-Layered Expectation Maximization for Parameter Learning in Bayesian Networks
The expectation maximization (EM) algorithm is a popular algorithm for parameter estimation in models with hidden variables. However, the algorithm has several non-trivial limitat...
Avneesh Singh Saluja, Priya Krishnan Sundararajan,...