3,463 reputation
1751
bio website regularize.wordpress.com
location Braunschweig, Germany
age 36
visits member for 4 years, 7 months
seen 3 hours ago

Professor at TU Braunschweig.

Area: Inverse problems, regularization theory, applied functional analysis, mathematical image processing.


Jan
25
comment Phase of the inner product between the elements of an ETF
Hmm you can multiply any frame element with any complex number of modulus one and still get another ETF. But well this changes all the inner products so probably you won't get an arbitrary distribution...
Jan
25
comment Recent trends in effective analysis
I suggest that you copy the titles of the references in the Wikipedia article into, e.g., Google Scholar and look for recent works that cite these works. Seems like there are plenty...
Jan
23
answered accelerate convex optimization by proximal projection
Jan
22
reviewed Leave Open About a completion of a Sobolev space
Jan
15
reviewed Leave Closed For which rational values of $c$ and $d$ are the numbers $\sin{(\pi\cdot c)}$, $\sin{(\pi\cdot d)}$ and $1$ linearly dependent over $\mathbb{Q}$?
Jan
15
reviewed Leave Open BDF2 and TR-BDF2: what is better?
Jan
13
reviewed Approve How to find the generic initial ideal?
Jan
13
reviewed Leave Open What is the idea behind interpolation spaces?
Jan
13
reviewed Leave Open Solution of a linearly constrained quadratic programming problem
Jan
13
reviewed Leave Open Getting a measure from a premeasure through an adjoint
Jan
13
reviewed Edit How to find the generic initial ideal?
Jan
13
revised How to find the generic initial ideal?
format edited
Jan
9
comment Are there any with Erdös number 1 on mathoverflow?
Evidence: "Coloring graphs with locally few colors" by P. Erdõs, Z. Füredi, A. Hajnal, P. Komjáth, V. Rödl, Á. Seress, Discrete Math., 59(1986), cs.elte.hu/~kope/localcoloring.pdf
Jan
5
comment What is the advantage of the knowledge of jumps for approximating a function with trigonometric polynomials?
For the first method there is no convergence in the sup-norm (Gibbs phenomenon).
Jan
4
comment distribution discretization
I suspect that you will not have approximation in the total variation distance but only weak approximation. Probably this can be quantified by Prokhorov or Wasserstein metrics but I don't know a good pointer...
Jan
4
revised Does removing some constraints in convex program change the optimal solution?
added 98 characters in body
Jan
4
comment Does removing some constraints in convex program change the optimal solution?
Jupp, this is also true in two variables.
Jan
4
answered Does removing some constraints in convex program change the optimal solution?
Dec
29
comment Finding sparsest solution of a linear system
Some good heuristics go under the name "pursuit", e.g. (regularized) (orthogonal) matching pursuit or basis pursuit.
Dec
26
comment An inequality concerning restricted isometry property
If you only have $supp(x) \subset S_1$ and $supp(y) \subset S_2$ then no lower bound greater than zero is to be expected and even if you have non-trivial intersection of the supports then the inner product can well be zero, I guess.