Star
Reputation
Top tag
Next privilege 75 Rep.
Set bounties
 Jan22 comment spline derivation Elements of Statistical Learning written by Tibshirani et al. Jan21 awarded Commentator Jan21 awarded Scholar Jan21 accepted spline derivation Jan21 comment spline derivation Thanks! And where can I find the proof of this theorem? Jan19 asked spline derivation Dec8 awarded Supporter Dec8 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? Dec2 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? Dec2 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? Dec1 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 Sep24 awarded Autobiographer Feb15 asked Convexity of a function Feb6 comment Uncertaint linear program why? I think it is dependent. Feb6 asked Uncertaint linear program Oct8 awarded Tumbleweed Oct1 awarded Editor Jul25 asked Feasibility checking Jul23 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)$? Jul23 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.