![Bridging Continuous and Discrete Optimization_hi-res logo](/sites/default/files/styles/workshop_banner_sm_1x/public/2023-01/Bridging%20Continuous%20and%20Discrete%20Optimization_hi-res.png.jpg?itok=b7fmT0eV)
Abstract
As we all know, Michael has read the proof from the book and gave out some proofs to us from time to time. In this talk, I will describe two of his proofs, one proof is about an input sparsity algorithm for Ax=b by uniform sampling. Another proof is about how to solve a sequence of slowly changing linear systems faster.