Many sequential decision problems can be formulated as Markov decision processes (MDPs) where the optimal value function (or cost-to-go function) can be shown to satisfy a monotone structure in some ...

Shipra Agrawal, Zizhuo Wang, Yinyu Ye, A Dynamic Near-Optimal Algorithm for Online Linear Programming, Operations Research, Vol. 62, No. 4 (July-August 2014), pp. 876-890 ...

Seeking to reduce the computing power needed for the widely used dynamic mode decomposition algorithm, a team of researchers in China led by Guo-Ping Guo developed a quantum-classical hybrid algorithm ...