We work on a variety of (non-)convex optimization problems and applications: especially projection and reflection methods and on maximum entropy methods formulated as feasibility or optimization problems.
We have expertise in graph theory and various other parts of discrete mathematics including enumerative combinatorics, formal power series and Hadamard matrices.