The traveling salesman problem is considered a prime example of a combinatorial optimization problem. Now a Berlin team led by theoretical physicist Prof. Dr. Jens Eisert of Freie Universität Berlin ...

In Part 1 of this series on optimization and recovery, we considered two limitations of optimization processes and the light they shed on pseudo-recovery. Let’s now think more about what the ...

A line of engineering research seeks to develop computers that can tackle a class of challenges called combinatorial optimization problems. These are common in real-world applications such as ...

The rise of AI, graphic processing, combinatorial optimization and other data-intensive applications has resulted in data-processing bottlenecks, as ever greater amounts of data must be shuttled back ...

Great progress has been made in the past few years in our understanding of nonconvex optimizations. In this talk, I will share with you three of our works in this direction. In one, we study low-rank ...