41 reputation
3
bio website
location
age 30
visits member for 2 years, 1 month
seen Jun 18 at 19:51

Ph.D. Student in Computer Science Max-Planck Institute for Informatics


Feb
15
asked Convexity of a function
Feb
6
comment Uncertaint linear program
why? I think it is dependent.
Feb
6
asked Uncertaint linear program
Oct
8
awarded  Tumbleweed
Oct
1
awarded  Editor
Jul
25
asked Feasibility checking
Jul
23
comment Solving an $n\times m $ linear system exactly
In my problem $m=O(n^2)$. So, the running time should be $O(n^4)$?
Jul
23
comment Solving an $n\times m $ linear system exactly
Thanks for your comment. What do you mean by exact values of entries? Is this typo? [and then multiplying by Q]. Shouldn't be $\tr(A)$. Any reference paper or lecture note would be appreciated.
Jul
23
comment Solving an $n\times m $ linear system exactly
n is max{n,m}. Right?
Jul
23
comment Solving an $n\times m $ linear system exactly
Some entries are integer ranged between 0,-1,1 and the other entries are rational.
Jul
23
asked Solving an $n\times m $ linear system exactly
Jul
20
asked LP unboundedness
Jul
20
asked unboundedness of an LP
Jul
20
asked Strict inequalities in LP
Jul
19
comment Checking feasibility of a system of inequalities
The question is whether feasibility of this polyhedral can be checked using ellipsoid method. Since in my problem entries are partly rational. If yes, what is the running time. I need it for theoretical part not practical side.
Jul
19
awarded  Student
Jul
19
asked Checking feasibility of a system of inequalities