default search action
Rachael Tappenden
Person information
- affiliation: University of Canterbury, Christchurch, New Zealand
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j14]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): 471-489 (2024) - 2022
- [j13]Abdurakhmon Sadiev, Ekaterina Borodich, Aleksandr Beznosikov, Darina Dvinskikh
Decentralized personalized federated learning: Lower bounds and optimal algorithm for all personalization modes. EURO J. Comput. Optim. 10: 100041 (2022) - [i7]Abdurakhmon Sadiev, Aleksandr Beznosikov
Stochastic Gradient Methods with Preconditioned Updates. CoRR abs/2206.00285 (2022) - [i6]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 abs/2211.00866 (2022) - 2021
- [j12]Majid Jahani, Naga Venkata C. Gudapati, Chenxin Ma, Rachael Tappenden
Fast and safe: accelerated gradient methods with optimality certificates and underestimate sequences. Comput. Optim. Appl. 79(2): 369-404 (2021) - [j11]Ian D. Coope, Rachael Tappenden
Gradient and diagonal Hessian approximations using quadratic interpolation models and aligned regular bases. Numer. Algorithms 88(2): 767-791 (2021) - [c1]Majid Jahani, MohammadReza Nazari, Rachael Tappenden, Albert S. Berahas, Martin Takác:
SONIA: A Symmetric Blockwise Truncated Optimization Algorithm. AISTATS 2021: 487-495
2010 – 2019
- 2019
- [j10]Ian D. Coope, Rachael Tappenden:
Efficient calculation of regular simplex gradients. Comput. Optim. Appl. 72(3): 561-588 (2019) - 2018
- [j9]Kimon Fountoulakis, Rachael Tappenden:
A flexible coordinate descent method. Comput. Optim. Appl. 70(2): 351-394 (2018) - [j8]Xi He, Rachael Tappenden, Martin Takác
Dual Free Adaptive Minibatch SDCA for Empirical Risk Minimization. Frontiers Appl. Math. Stat. 4: 33 (2018) - [j7]Rachael Tappenden, Martin Takác
On the complexity of parallel coordinate descent. Optim. Methods Softw. 33(2): 372-395 (2018) - 2017
- [j6]Daniel P. Robinson, Rachael Tappenden:
A Flexible ADMM Algorithm for Big Data Applications. J. Sci. Comput. 71(1): 435-467 (2017) - [i5]Chenxin Ma, Naga Venkata C. Gudapati, Majid Jahani, Rachael Tappenden, Martin Takác:
Underestimate Sequences via Quadratic Averaging. CoRR abs/1710.03695 (2017) - 2016
- [j5]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: 230:1-230:24 (2016) - [j4]Rachael Tappenden, Peter Richtárik, Jacek Gondzio:
Inexact Coordinate Descent: Complexity and Preconditioning. J. Optim. Theory Appl. 170(1): 144-176 (2016) - 2015
- [j3]Rachael Tappenden, Peter Richtárik, Burak Büke:
Separable approximations and decomposition methods for the augmented Lagrangian. Optim. Methods Softw. 30(3): 643-668 (2015) - [i4]Chenxin Ma, Rachael Tappenden, Martin Takác:
Linear Convergence of the Randomized Feasible Descent Method Under the Weak Strong Convexity Assumption. CoRR abs/1506.02530 (2015) - 2013
- [i3]Rachael Tappenden, Peter Richtárik, Jacek Gondzio:
Inexact Coordinate Descent: Complexity and Preconditioning. CoRR abs/1304.5530 (2013) - [i2]Rachael Tappenden, Peter Richtárik, Burak Büke:
Separable Approximations and Decomposition Methods for the Augmented Lagrangian. CoRR abs/1308.6774 (2013) - 2011
- [j2]Robert L. Broughton, Ian D. Coope, Peter F. Renaud, Rachael Tappenden:
A box constrained gradient projection algorithm for compressed sensing. Signal Process. 91(8): 1985-1992 (2011) - 2010
- [j1]Robert L. Broughton, Ian D. Coope, Peter Renaud, Rachael Tappenden:
Determinant and Exchange Algorithms for Observation Subset Selection. IEEE Trans. Image Process. 19(9): 2437-2443 (2010)
2000 – 2009
- 2009
- [i1]Robert L. Broughton, Ian D. Coope, Peter Renaud, Rachael Tappenden:
A Barzilai-Borwein $l_1$-Regularized Least Squares Algorithm for Compressed Sensing. CoRR abs/0907.3340 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:20 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: