Let A and B be nonempty, convex and closed subsets of a Hilbert space H. In the practical considerations we need to find an element of the intersection A B or, more general, to s...
This paper describes a new approximate maximum-likelihood (ML) MIMO detection approach by studying a Lagrangian dual relaxation (LDR) of ML. Unlike many existing relaxed ML method...
Abstract. We propose and study a block-iterative projections method for solving linear equations and/or inequalities. The method allows diagonal component-wise relaxation in conjun...
Yair Censor, Tommy Elfving, Gabor T. Herman, Toura...
We study the convergence properties of an alternating proximal minimization algorithm for nonconvex structured functions of the type: L(x, y) = f(x)+Q(x, y)+g(y), where f : Rn → ...
We propose a relaxed correspondence assumption for cross-lingual projection of constituent syntax, which allows a supposed constituent of the target sentence to correspond to an u...