Rachael Tappenden

LecturerRachael Tappenden

Jack Erskine 714
Internal Phone: 92437


Research Interests

My research interests lie in the broad area of optimization and numerical linear algebra.

Recent Publications

  • Fountoulakis K. and Tappenden R. (2018) A flexible coordinate descent method. Computational Optimization and Applications 70(2): 351-394. http://dx.doi.org/10.1007/s10589-018-9984-3.
  • Tappenden R., Takáč M. and Richtárik P. (2018) On the complexity of parallel coordinate descent. Optimization Methods and Software 33(2): 372-395. http://dx.doi.org/10.1080/10556788.2017.1392517.
  • Robinson DP. and Tappenden R. (2017) A Flexible ADMM Algorithm for Big Data Applications. Journal of Scientific Computing 71(1): 435-467. http://dx.doi.org/10.1007/s10915-016-0306-6.
  • Ma C., Tappenden R. and Takac M. (2016) Linear convergence of randomized feasible descent methods under the weak strong convexity assumption. Journal of Machine Learning Research 17(230): 1-24.
  • Tappenden R., Richtárik P. and Gondzio J. (2016) Inexact Coordinate Descent: Complexity and Preconditioning. Journal of Optimization Theory and Applications 170(1): 144-176. http://dx.doi.org/10.1007/s10957-016-0867-4.