Rachael Tappenden

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 15

Top Topics

Decomposition Methods

Computationally Tractable

Augmented Lagrangian

Top Venues

Comput. Optim. Appl.

J. Optim. Theory Appl.

Optim. Methods Softw.

Publications

Abdurakhmon Sadiev, Aleksandr Beznosikov, Abdulla Jasem Almansoori, Dmitry Kamzolov, Rachael Tappenden, Martin Takác
Stochastic Gradient Methods with Preconditioned Updates. J. Optim. Theory Appl. 201 (2) (2024)
Rachael Tappenden, Martin Takác
Gradient Descent and the Power Method: Exploiting their connection to find the leftmost eigen-pair and escape saddle points. CoRR (2022)
Abdurakhmon Sadiev, Ekaterina Borodich, Aleksandr Beznosikov, Darina Dvinskikh, Saveliy Chezhegov, Rachael Tappenden, Martin Takác, Alexander V. Gasnikov
Decentralized personalized federated learning: Lower bounds and optimal algorithm for all personalization modes. EURO J. Comput. Optim. 10 (2022)
Abdurakhmon Sadiev, Aleksandr Beznosikov, Abdulla Jasem Almansoori, Dmitry Kamzolov, Rachael Tappenden, Martin Takác
Stochastic Gradient Methods with Preconditioned Updates. CoRR (2022)
Majid Jahani, Naga Venkata C. Gudapati, Chenxin Ma, Rachael Tappenden, Martin Takác
Fast and safe: accelerated gradient methods with optimality certificates and underestimate sequences. Comput. Optim. Appl. 79 (2) (2021)
Majid Jahani, MohammadReza Nazari, Rachael Tappenden, Albert S. Berahas, Martin Takác
SONIA: A Symmetric Blockwise Truncated Optimization Algorithm. AISTATS (2021)
Ian D. Coope, Rachael Tappenden
Gradient and diagonal Hessian approximations using quadratic interpolation models and aligned regular bases. Numer. Algorithms 88 (2) (2021)
Ian D. Coope, Rachael Tappenden
Efficient calculation of regular simplex gradients. Comput. Optim. Appl. 72 (3) (2019)
Xi He, Rachael Tappenden, Martin Takác
Dual Free Adaptive Minibatch SDCA for Empirical Risk Minimization. Frontiers Appl. Math. Stat. 4 (2018)
Rachael Tappenden, Martin Takác, Peter Richtárik
On the complexity of parallel coordinate descent. Optim. Methods Softw. 33 (2) (2018)
Kimon Fountoulakis, Rachael Tappenden
A flexible coordinate descent method. Comput. Optim. Appl. 70 (2) (2018)
Daniel P. Robinson, Rachael Tappenden
A Flexible ADMM Algorithm for Big Data Applications. J. Sci. Comput. 71 (1) (2017)
Chenxin Ma, Naga Venkata C. Gudapati, Majid Jahani, Rachael Tappenden, Martin Takác
Underestimate Sequences via Quadratic Averaging. CoRR (2017)
Chenxin Ma, Rachael Tappenden, Martin Takác
Linear Convergence of Randomized Feasible Descent Methods Under the Weak Strong Convexity Assumption. J. Mach. Learn. Res. 17 (2016)
Rachael Tappenden, Peter Richtárik, Jacek Gondzio
Inexact Coordinate Descent: Complexity and Preconditioning. J. Optim. Theory Appl. 170 (1) (2016)
Chenxin Ma, Rachael Tappenden, Martin Takác
Linear Convergence of the Randomized Feasible Descent Method Under the Weak Strong Convexity Assumption. CoRR (2015)
Rachael Tappenden, Peter Richtárik, Burak Büke
Separable approximations and decomposition methods for the augmented Lagrangian. Optim. Methods Softw. 30 (3) (2015)
Rachael Tappenden, Peter Richtárik, Burak Büke
Separable Approximations and Decomposition Methods for the Augmented Lagrangian. CoRR (2013)
Rachael Tappenden, Peter Richtárik, Jacek Gondzio
Inexact Coordinate Descent: Complexity and Preconditioning CoRR (2013)
Robert L. Broughton, Ian D. Coope, Peter F. Renaud, Rachael Tappenden
A box constrained gradient projection algorithm for compressed sensing. Signal Process. 91 (8) (2011)
Robert L. Broughton, Ian D. Coope, Peter Renaud, Rachael Tappenden
Determinant and Exchange Algorithms for Observation Subset Selection. IEEE Trans. Image Process. 19 (9) (2010)
Robert L. Broughton, Ian D. Coope, Peter Renaud, Rachael Tappenden
A Barzilai-Borwein $l_1$-Regularized Least Squares Algorithm for Compressed Sensing CoRR (2009)