Search Results for author: Rachael Tappenden

Found 5 papers, 0 papers with code

Fast and Safe: Accelerated gradient methods with optimality certificates and underestimate sequences

no code implementations10 Oct 2017 Majid Jahani, Naga Venkata C. Gudapati, Chenxin Ma, Rachael Tappenden, Martin Takáč

In this work we introduce the concept of an Underestimate Sequence (UES), which is motivated by Nesterov's estimate sequence.

Linear Convergence of the Randomized Feasible Descent Method Under the Weak Strong Convexity Assumption

no code implementations8 Jun 2015 Chenxin Ma, Rachael Tappenden, Martin Takáč

We show that the famous SDCA algorithm for optimizing the SVM dual problem, or the stochastic coordinate descent method for the LASSO problem, fits into the framework of RC-FDM.

Separable Approximations and Decomposition Methods for the Augmented Lagrangian

no code implementations30 Aug 2013 Rachael Tappenden, Peter Richtarik, Burak Buke

In this paper we study decomposition methods based on separable approximations for minimizing the augmented Lagrangian.

Inexact Coordinate Descent: Complexity and Preconditioning

no code implementations19 Apr 2013 Rachael Tappenden, Peter Richtárik, Jacek Gondzio

In this paper we consider the problem of minimizing a convex function using a randomized block coordinate descent method.

Cannot find the paper you are looking for? You can Submit a new open access paper.