Sciweavers

Share
203 search results - page 1 / 41
» Relaxed Alternating Projection Methods
Sort
View
SIAMJO
2008
136views more  SIAMJO 2008»
8 years 5 months ago
Relaxed Alternating Projection Methods
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...
Andrzej Cegielski, Agnieszka Suchocka
ACSSC
2015
2views more  ACSSC 2015»
3 years 2 months ago
Design of spectrally shaped binary sequences via randomized convex relaxations
—In wideband communication one often aims to detect a weak signal received together with a strong interferer. One can design a spectrally shaped sequence to be convolved with the...
Dian Mo, Marco F. Duarte
SIAMSC
2008
127views more  SIAMSC 2008»
8 years 6 months ago
On Diagonally Relaxed Orthogonal Projection Methods
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...
ICASSP
2011
IEEE
7 years 10 months ago
A Lagrangian dual relaxation approach to ML MIMO detection: Reinterpreting regularized lattice decoding
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...
Jiaxian Pan, Wing-Kin Ma
FOCM
2016
3 years 2 months ago
On Local Convergence of the Method of Alternating Projections
The method of alternating projections is a classical tool to solve feasibility problems. Here we prove local convergence of alternating projections between subanalytic sets A, B u...
Dominikus Noll, Aude Rondepierre
books