Block Decomposable Methods for Large-Scale Optimization Problems

TL;DR

This dissertation develops advanced block decomposable optimization algorithms, including a new adaptive proximal ADMM and inexact block coordinate descent methods, demonstrating their efficiency and convergence guarantees for large-scale problems.

Contribution

It introduces a novel adaptive proximal ADMM algorithm and establishes convergence rates for inexact block coordinate descent methods on broad function classes.

Findings

The new proximal ADMM is adaptive and efficiently solves the proximal AL subproblem.

The proposed BCD methods achieve convergence rates comparable to exact methods.

Numerical results show superior performance under dynamic error regimes.

Abstract

This dissertation explores block decomposable methods for large-scale optimization problems. It focuses on alternating direction method of multipliers (ADMM) schemes and block coordinate descent (BCD) methods. Specifically, it introduces a new proximal ADMM algorithm and proposes two BCD methods. The first part of the research presents a new proximal ADMM algorithm. This method is adaptive to all problem parameters and solves the proximal augmented Lagrangian (AL) subproblem inexactly. This adaptiveness facilitates the highly efficient application of the algorithm to a broad swath of practical problems. The inexact solution of the proximal AL subproblem overcomes many key challenges in the practical applications of ADMM. The resultant algorithm obtains an approximate solution of an optimization problem in a number of iterations that matches the state-of-the-art complexity for the class of proximal ADMM schemes. The second part of the research focuses on an inexact proximal mapping for the class of block proximal gradient methods. Key properties of this operator is established, facilitating the derivation of convergence rates for the proposed algorithm. Under two error decreases conditions, the algorithm matches the convergence rate of its exactly computed counterpart. Numerical results demonstrate the superior performance of the algorithm under a dynamic error regime over a fixed one. The dissertation concludes by providing convergence guarantees for the randomized BCD method applied to a broad class of functions, known as H\"older smooth functions. Convergence rates are derived for non-convex, convex, and strongly convex functions. These convergence rates match those furnished in the existing literature for the Lipschtiz smooth setting.