The stochastic root-finding problem is that of finding a zero of a vector-valued function known only through a stochastic simulation. The simulation-optimization problem is that of locating a ...

This course studies approximation algorithms – algorithms that are used for solving hard optimization problems. Such algorithms find approximate (slightly suboptimal) solutions to optimization ...

Hyped as the solution to many problems – both hard and easy – quantum-enhanced optimization is a burgeoning research field. But with untrainable circuits, “barren plateaus” and deceptive local minimas ...