Is it possible in general for the dual problem of a concave minimization problem to be a convex LP/QP?
Specifically, can the concave minimization problem $$ \min_{x\in\mathbb{R}^n} -\lVert x\rVert_1 $$ be rewritten as a convex LP/QP in any way, either using duality of with some other tricks?