The original version of this story appeared in Quanta Magazine. In 1939, upon arriving late to his statistics course at UC Berkeley, George Dantzig—a first-year graduate student—copied two problems ...

The leading approach to the simplex method, a widely used technique for balancing complex logistical constraints, can’t get any better. In 1939, upon arriving late to his statistics course at the ...

Despite the widespread success of neural networks, their susceptibility to adversarial examples remains a significant challenge. Adversarial training (AT) has emerged as an effective approach to ...

H_index, The h-index of the journal, which measures both the productivity and citation impact of the publications. g_index, The g-index of the journal, which gives more weight to highly-cited articles ...

Since its creation more than two decades ago by Daniel Spielman (above) and Shang-hua Teng, smoothed analysis has been used to analyze performance of algorithms other than the simplex method, ...

Abstract: Inverse problem requiring repeated forward computation is a hard ill-posed problem. Traditional linear inversion methods like Newton method and Newton-like methods may not be optimal ...

Nestled among the impressive domes and spires of Yale University is the simple office of Daniel Spielman. His shelves are lined with tall black notebooks, containing decades of handwritten notes, and ...

Abstract: A new heuristic optimization algorithm is presented to solve the nonlinear optimization problems. The proposed algorithm utilizes a stochastic method to achieve the optimal point based on ...