Reputation
Top tag
Next privilege 75 Rep.
Set bounties
Badges
8
Impact
~2k people reached

  • 0 posts edited
  • 0 helpful flags
  • 2 votes cast
May
1
awarded  Popular Question
Jan
22
comment spline derivation
Elements of Statistical Learning written by Tibshirani et al.
Jan
21
awarded  Commentator
Jan
21
awarded  Scholar
Jan
21
accepted spline derivation
Jan
21
comment spline derivation
Thanks! And where can I find the proof of this theorem?
Jan
19
asked spline derivation
Dec
8
awarded  Supporter
Dec
8
comment Efficiency of a max-min problem for $\sum_{j=1}^m |b_j-a_j|$ with $a_i$, $b_j$ restricted to convex sets
I have still a problem. Could this hardness result remain valid if the polytope is in positive orthant of $\mathcal{R}^n$? In other words, $A\subseteq \mathcal{R}^n_{+}$ and bounded?
Dec
2
comment Efficiency of a max-min problem for $\sum_{j=1}^m |b_j-a_j|$ with $a_i$, $b_j$ restricted to convex sets
Thanks Johan. This reduction is something that I could see it before. But I think it is not convincing enough for my problem. The set B that variables $b$ come from, does not include zero value. Can I still claim the intractability by plugging a impossible value b=0?
Dec
2
comment Efficiency of a max-min problem for $\sum_{j=1}^m |b_j-a_j|$ with $a_i$, $b_j$ restricted to convex sets
Thanks Michael for your answer. BTW, can you hint on some reductions to show the intractabilty?
Dec
1
asked Efficiency of a max-min problem for $\sum_{j=1}^m |b_j-a_j|$ with $a_i$, $b_j$ restricted to convex sets
Sep
24
awarded  Autobiographer
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)$?