Ergodic sequence

When solving a convex optimization problem through a Lagrangian dual reformulation subgradient optimization methods are favorably… (More)

The characterization of ℓ_p-compressible random sequences is revisited and extended to the case of stationary… (More)

We analyze the asymptotic behavior of sequences of random variables (x(n))n∈N defined by an initial condition and the induction… (More)

We determine the limit distribution (as λ → ∞) of complex zeros for holomorphic continuations φCλ to Grauert tubes of real… (More)

In a previous paper, BonaId and Roberts (June 2001) studied non-persistent TCP connections in transient overload conditions… (More)

Lagrangean dualization and subgradient optimization techniques are frequently used within the field of computational optimization… (More)

When nonsmooth, convex minimizationproblems are solved by subgradientoptimizationmethods, the subgradients used will in general… (More)

Subgradient methods are popular tools for nonsmooth, convex minimization , especially in the context of Lagrangean relaxation… (More)

Recently, Wyner and Ziv have proved that the typical length of a repeated subword found within the first n positions of a… (More)

We consider families of operators, Hω, on ^2 given by (Hωύ)(n) = u(n + 1) + u(n1) + Vω(ή)u(n\ where Vω is a stationary bounded… (More)