Skip to main content

All Questions

Filter by
Sorted by
Tagged with
4 votes
2 answers
734 views

Fast projection onto a subspace

Given an $n$-dimensional vector $\mathbf{c}\in [0,1]^n$, let $\Delta_{\mathbf{c}}$ be the set of points $\{\mathbf{x}\in [0,1]^n: \langle \mathbf{c},\mathbf{x} \rangle \le 1\}$, where $\langle \mathbf{...
Penelope Benenati's user avatar
4 votes
1 answer
821 views

Checking if a binary vector lies in the affine span of given binary vectors

Let $x_1,\ldots,x_N \in \{0,1\}^D$ be $N$ binary vectors in ${\mathbb R}^D$, assumed affinely independent. Is there an efficient algorithm for determining whether a new binary vector $x_{N+1}$ is in ...
Andre's user avatar
  • 41
1 vote
0 answers
38 views

Efficient solution to linear matrix equations

A general form for a linear matrix equation can be written as $$AX + XB + \sum C_iXD_i$$ If $C_i$ and $D_i$ are all 0, then this simplifies into a well known and studied matrix equation that has an ...
Scezory's user avatar
  • 11