213 search results - page 25 / 43 » Semidefinite programming |
SIAMJO
2008
13 years 8 months ago
2008
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...
TCS
2008
13 years 8 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
TSMC
2002
13 years 8 months ago
2002
This paper discusses the problem of approximating data points in -dimensional Euclidean space using spherical and ellipsoidal surfaces. A closed form solution is provided for spher...
CDC
2010
IEEE
13 years 3 months ago
2010
IEEE
This paper proposes a novel approach to stability analysis and controller synthesis for discrete-time periodically time-varying systems. Firstly, a relaxation of standard Lyapunov ...
TWC
2010
13 years 3 months ago
2010
Only one asymptotic training design for a special case of channel correlation was proposed in the literature for spatially correlated multiple-input multiple-output with orthogonal...