Constructs linear underestimators of convex functions by tractable black-box sampling. Implemented in Julia.

Formulates and solves nonogram puzzles (a.k.a. Picross and paint-by-number) in Julia. Uses a new integer linear programming formulation, and solves it with JuMP.