LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

A partially inexact ADMM with o(1/n) asymptotic convergence rate, ????(1/n) complexity, and immediate relative error tolerance

Photo from wikipedia

In this work, we propose a new partially inexact Alternating Direction Method of Multipliers (ADMM) with relative error tolerance. This method departs from previous semi-inexact variants of the ADMM by… Click to show full abstract

In this work, we propose a new partially inexact Alternating Direction Method of Multipliers (ADMM) with relative error tolerance. This method departs from previous semi-inexact variants of the ADMM by allowing the second subproblem to be solved inexactly, instead of the first one. Relative error tolerance criteria for inexact ADMM methods require, to be verified, the solution of the two proximal subproblems in each iteration; therefore, by allowing for inexactness in the approximate solutions of the second subproblem, the error criterion is immediately testable during the computation of that approximate solution and no backtracking is required. In this sense, the proposed method uses an immediate error criterion. We also establish iteration complexity and asymptotic convergence rate for a modified ergodic mean, with respect to the residuals in Karush–Kuhn–Tucker conditions. As far as we know, this is the first asymptotic convergence rate, with respect to this error measure, for ADMM applied to a general problem.

Keywords: asymptotic convergence; error tolerance; relative error; error; convergence rate

Journal Title: Optimization
Year Published: 2020

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.