1
vote
1answer
173 views

A counter example of best approximation

Construct a point $f\in C[0,1]$ and a closed subspace $V\subset C[0,1]$ such that $f$ does not have a best approximation in $V$. Definition: $C[0,1]$ is the set of countinous function with the norm ...
2
votes
1answer
306 views

Upper and lower bounds of a ratio involving vector norms

I'm working on a signal processing problem and need to analyze the following expression $$ G = \frac{n}{\sum\limits_{i=1}^n |w_i|} \frac{ \sum\limits_{i=1}^n g_i w_i^2}{\sum\limits_{i=1}^n g_i |w_i|} ...
3
votes
0answers
222 views

Minimizing maximum absolute column sum norm of the residual between a matrix and its $k$-rank approximation

Let $X \in \mathbb{R}^{m\times n}$ be a matrix with rank $r$. How can we find the optimal $\tilde{X} \in \mathbb{R}^{m\times n}$ whose rank is $k$ where $k\leq r$ and the reconstruction error in ...
1
vote
0answers
131 views

Upper bound for L1-L2 optimization problem

I am interested in the following convex optimization problem: \begin{align*} \max & ||x||_1 \\ \text{s.t.} & ||x-a||_1 \le K \\ & ||b\circ x||_2 \le 1\\ & x \in R^n \end{align*} where ...
1
vote
0answers
190 views

Bound on euclidean norm

Is it possible to find a suitable lower bound on $$\left|\left(tM+\sum_{k=2}^\infty\frac{(tM)^k}{k!}\right)\cdot b\right|$$ for $M$ as $n \times n$ matrix, $b$ as $1 \times n$ vector and for all $t$ ...