We stand with Ukraine  

Rachael Tappenden

Orcid: 0000-0002-8011-1442

Affiliations:
  • University of Canterbury, Christchurch, New Zealand


According to our database1, Rachael Tappenden authored at least 19 papers between 2009 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Decentralized personalized federated learning: Lower bounds and optimal algorithm for all personalization modes.
[BibTeX]
[DOI]
Abdurakhmon Sadiev
,
Ekaterina Borodich
,
Aleksandr Beznosikov
,
Darina Dvinskikh
,
Saveliy Chezhegov
,
Rachael Tappenden
,
Martin Takác
,
Alexander V. Gasnikov
EURO J. Comput. Optim., 2022

Gradient Descent and the Power Method: Exploiting their connection to find the leftmost eigen-pair and escape saddle points.
[BibTeX]
[DOI]
Rachael Tappenden
,
Martin Takác
CoRR, 2022

Stochastic Gradient Methods with Preconditioned Updates.
[BibTeX]
[DOI]
Abdurakhmon Sadiev
,
Aleksandr Beznosikov
,
Abdulla Jasem Almansoori
,
Dmitry Kamzolov
,
Rachael Tappenden
,
Martin Takác
CoRR, 2022

2021
Gradient and diagonal Hessian approximations using quadratic interpolation models and aligned regular bases.
[BibTeX]
[DOI]
Ian D. Coope
,
Rachael Tappenden
Numer. Algorithms, 2021

Fast and safe: accelerated gradient methods with optimality certificates and underestimate sequences.
[BibTeX]
[DOI]
Majid Jahani
,
Naga Venkata C. Gudapati
,
Chenxin Ma
,
Rachael Tappenden
,
Martin Takác
Comput. Optim. Appl., 2021

SONIA: A Symmetric Blockwise Truncated Optimization Algorithm.
[BibTeX]
[DOI]
Majid Jahani
,
MohammadReza Nazari
,
Rachael Tappenden
,
Albert S. Berahas
,
Martin Takác
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2019
Efficient calculation of regular simplex gradients.
[BibTeX]
[DOI]
Ian D. Coope
,
Rachael Tappenden
Comput. Optim. Appl., 2019

2018
On the complexity of parallel coordinate descent.
[BibTeX]
[DOI]
Rachael Tappenden
,
Martin Takác
,
Peter Richtárik
Optim. Methods Softw., 2018

Dual Free Adaptive Minibatch SDCA for Empirical Risk Minimization.
[BibTeX]
[DOI]
Xi He
,
Rachael Tappenden
,
Martin Takác
Frontiers Appl. Math. Stat., 2018

A flexible coordinate descent method.
[BibTeX]
[DOI]
Kimon Fountoulakis
,
Rachael Tappenden
Comput. Optim. Appl., 2018

2017
A Flexible ADMM Algorithm for Big Data Applications.
[BibTeX]
[DOI]
Daniel P. Robinson
,
Rachael Tappenden
J. Sci. Comput., 2017

Underestimate Sequences via Quadratic Averaging.
[BibTeX]
[DOI]
Chenxin Ma
,
Naga Venkata C. Gudapati
,
Majid Jahani
,
Rachael Tappenden
,
Martin Takác
CoRR, 2017

2016
Inexact Coordinate Descent: Complexity and Preconditioning.
[BibTeX]
[DOI]
Rachael Tappenden
,
Peter Richtárik
,
Jacek Gondzio
J. Optim. Theory Appl., 2016

Linear Convergence of Randomized Feasible Descent Methods Under the Weak Strong Convexity Assumption.
[BibTeX]
[DOI]
Chenxin Ma
,
Rachael Tappenden
,
Martin Takác
J. Mach. Learn. Res., 2016

2015
Separable approximations and decomposition methods for the augmented Lagrangian.
[BibTeX]
[DOI]
Rachael Tappenden
,
Peter Richtárik
,
Burak Büke
Optim. Methods Softw., 2015

Linear Convergence of the Randomized Feasible Descent Method Under the Weak Strong Convexity Assumption.
[BibTeX]
[DOI]
Chenxin Ma
,
Rachael Tappenden
,
Martin Takác
CoRR, 2015

2011
A box constrained gradient projection algorithm for compressed sensing.
[BibTeX]
[DOI]
Robert L. Broughton
,
Ian D. Coope
,
Peter F. Renaud
,
Rachael Tappenden
Signal Process., 2011

2010
Determinant and Exchange Algorithms for Observation Subset Selection.
[BibTeX]
[DOI]
Robert L. Broughton
,
Ian D. Coope
,
Peter Renaud
,
Rachael Tappenden
IEEE Trans. Image Process., 2010

2009
A Barzilai-Borwein $l_1$-Regularized Least Squares Algorithm for Compressed Sensing
[BibTeX]
[DOI]
Robert L. Broughton
,
Ian D. Coope
,
Peter Renaud
,
Rachael Tappenden
CoRR, 2009


  Loading...