Nadav Hallak, PhD candidate, won the Jacobs award for excellent published academic paper.

Nadav's paper studies algorithms and optimality conditions in problems in which the objective function is the sum of a continuous function and a penalty function on the number of non-zero elements (sparsity), over a constrained set. The motivation behind this setting is to obtain a sparse solution,  which a highly sought-after property in many applications.