Research/Scholarly/Creative Works

• Sadiev A., Borodich E., Beznosikov A., Dvinskikh D., Chezhegov S., Tappenden R., Takáč M. and Gasnikov A. (2022) Decentralized personalized federated learning: Lower bounds and optimal algorithm for all personalization modes. EURO Journal on Computational Optimization 10 http://dx.doi.org/10.1016/j.ejco.2022.100041. (Journal Articles)

• Coope ID. and Tappenden R. (2021) Gradient and diagonal Hessian approximations using quadratic interpolation models and aligned regular bases. Numerical Algorithms 88(2): 767-791. http://dx.doi.org/10.1007/s11075-020-01056-8. (Journal Articles)

• Jahani M., Gudapati NVC., Ma C., Tappenden R. and Takáč M. (2021) Fast and safe: accelerated gradient methods with optimality certificates and underestimate sequences. Computational Optimization and Applications 79(2): 369-404. http://dx.doi.org/10.1007/s10589-021-00269-4. (Journal Articles)

• Coope I. and Tappenden R. (2019) Efficient calculation of regular simplex gradients. Computational Optimization and Applications 72(3): 561-588. http://dx.doi.org/10.1007/s10589-019-00063-3. (Journal Articles)

• Coup S., Vetrova V., Frank E. and Rachael T. (2019) Domain specific transfer learning using image mixing and and stochastic image selection. In. (Conference Contributions - Published)

• 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. (Journal Articles)

• He X., Tappenden R. and Takáč M. (2018) Dual Free Adaptive Minibatch SDCA for Empirical Risk Minimization. Frontiers in Applied Mathematics and Statistics 4 http://dx.doi.org/10.3389/fams.2018.00033. (Journal Articles)

• 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. (Journal Articles)

• 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. (Journal Articles)

• 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. (Journal Articles)

• 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. (Journal Articles)

• Tappenden R., Richtárik P. and Büke B. (2015) Separable approximations and decomposition methods for the augmented Lagrangian. Optimization Methods and Software 30(3): 643-668. http://dx.doi.org/10.1080/10556788.2014.966824. (Journal Articles)

• Tappenden R., Hegarty J., Broughton R., Butler A., Coope I. and Renaud P. (2013) X-ray image enhancement via determinant based feature selection. Australasian Physical & Engineering Sciences in Medicine 36(4): 449-455. http://dx.doi.org/10.1007/s13246-013-0221-1. (Journal Articles)

• Peng., H., Hengyong., Y., Thayer., P., Xin., J., Qiong. and X. (2012) Preliminary experimental results from a MARS micro-CT system. Journal of X-Ray Science and Technology 20(2): 199-211. http://dx.doi.org/10.3233/XST-2012-0329. (Journal Articles)

• Broughton RL., Coope ID., Renaud PF. and Tappenden RE. (2011) A box constrained gradient projection algorithm for compressed sensing. Signal Processing 91(8): 1985-1992. http://dx.doi.org/10.1016/j.sigpro.2011.03.003. (Journal Articles)

• Broughton RL., Coope ID., Renaud PF. and Tappenden REH. (2011) Recovery of localised structure from signals with non-sparse components. In ANZIAM Journal 52: 567-580. (Conference Contributions - Published)

• Tappenden REH. (2011) Development and Implementation of Algorithms for Fast Image Reconstruction. Christchurch, New Zealand. University of Canterbury. (Theses / Dissertations)

• Broughton R., Coope I., Renaud P. and Tappenden R. (2010) Determinant and exchange algorithms for observation subset selection. IEEE Transactions on Image Processing 19(9): 2437-2443. http://dx.doi.org/10.1109/TIP.2010.2048150. (Journal Articles)

• Broughton R., Coope I., Renaud P. and Tappenden R. (2010) Recovery of localised structure from signals with non-sparse components. In ANZIAM Journal 52: 567-580. (Conference Contributions - Published)

• Broughton R., Coope I., Renaud P. and Tappenden R. (2009) A Barzilai-Borwein $l_1$-Regularized Least Squares Algorithm for Compressed Sensing.1-16. (Reports)

Review and Refereeing

• IEEE Transactions on Pattern Analysis and Machine Intelligence ( 2012 - 2023)
• Journal of Machine Learning Research ( 2012 - 2023)
• Optimization Methods and Software ( 2012 - 2023)
• SIAM Journal of Optimization ( 2012 - 2023)

Research Groups