Sciweavers

2446 search results - page 43 / 490
» Where am I
Sort
View
NA
2008
99views more  NA 2008»
13 years 9 months ago
Nontensorial Clenshaw-Curtis cubature
We extend Clenshaw-Curtis quadrature to the square in a nontensorial way, by using Sloan's hyperinterpolation theory and two families of points recently studied in the framew...
Alvise Sommariva, Marco Vianello, Renato Zanovello
ITA
2000
13 years 9 months ago
Construction of very hard functions for multiparty communication complexity
We consider the multiparty communication model de ned in 4] using the formalism from 8]. First, we correct an inaccuracy in the proof of the fundamental result of 6] providing a lo...
Ján Manuch
SIAMCO
2000
104views more  SIAMCO 2000»
13 years 9 months ago
Law of the Iterated Logarithm for a Constant-Gain Linear Stochastic Gradient Algorithm
We study almost-sure limiting properties, taken as 0, of the finite horizon sequence of random estimates { 0, 1, 2, . . . , T/ } for the linear stochastic gradient algorithm n+1 ...
J. A. Joslin, A. J. Heunis
SIAMJO
2000
86views more  SIAMJO 2000»
13 years 9 months ago
On the SQAP-Polytope
The SQAP-polytope was associated to quadratic assignment problems with a certain symmetric objective function structure by Rijal (1995) and Padberg and Rijal (1996). We derive a te...
Michael Jünger, Volker Kaibel
SIAMJO
2000
67views more  SIAMJO 2000»
13 years 9 months ago
Gradient Convergence in Gradient methods with Errors
We consider the gradient method xt+1 = xt + t(st + wt), where st is a descent direction of a function f : n and wt is a deterministic or stochastic error. We assume that f is Lip...
Dimitri P. Bertsekas, John N. Tsitsiklis