Inexact Coordinate Descent: Complexity and Preconditioning

04/19/2013
by   Rachael Tappenden, et al.
0

In this paper we consider the problem of minimizing a convex function using a randomized block coordinate descent method. One of the key steps at each iteration of the algorithm is determining the update to a block of variables. Existing algorithms assume that in order to compute the update, a particular subproblem is solved exactly. In his work we relax this requirement, and allow for the subproblem to be solved inexactly, leading to an inexact block coordinate descent method. Our approach incorporates the best known results for exact updates as a special case. Moreover, these theoretical guarantees are complemented by practical considerations: the use of iterative techniques to determine the update as well as the use of preconditioning for further acceleration.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/19/2019

Convergence Analysis of Inexact Randomized Iterative Methods

In this paper we present a convergence rate analysis of inexact variants...
research
09/18/2016

On Randomized Distributed Coordinate Descent with Quantized Updates

In this paper, we study the randomized distributed coordinate descent al...
research
11/09/2017

Smooth Primal-Dual Coordinate Descent Algorithms for Nonsmooth Convex Optimization

We propose a new randomized coordinate descent method for a convex optim...
research
07/14/2011

Iteration Complexity of Randomized Block-Coordinate Descent Methods for Minimizing a Composite Function

In this paper we develop a randomized block-coordinate descent method fo...
research
09/28/2020

Gradient based block coordinate descent algorithms for joint approximate diagonalization of matrices

In this paper, we propose a gradient based block coordinate descent (BCD...
research
07/03/2023

Analyzing and Improving Greedy 2-Coordinate Updates for Equality-Constrained Optimization via Steepest Descent in the 1-Norm

We consider minimizing a smooth function subject to a summation constrai...
research
03/01/2023

Fast and Interpretable Dynamics for Fisher Markets via Block-Coordinate Updates

We consider the problem of large-scale Fisher market equilibrium computa...

Please sign up or login with your details

Forgot password? Click here to reset