{
  "id": "1705.02502",
  "version": "v1",
  "published": "2017-05-06T16:35:08.000Z",
  "updated": "2017-05-06T16:35:08.000Z",
  "title": "Linearized ADMM for Non-convex Non-smooth Optimization with Convergence Analysis",
  "authors": [
    "Qinghua Liu",
    "Xinyue Shen",
    "Yuantao Gu"
  ],
  "comment": "31 pages",
  "categories": [
    "math.OC",
    "cs.IT",
    "math.IT"
  ],
  "abstract": "Linearized alternating direction method of multipliers (ADMM) as an extension of ADMM has been widely used to solve linearly constrained problems in signal processing, machine leaning, communications, and many other fields. Despite its broad applications in non-convex optimization, for a great number of non-convex and non-smooth objective functions, its theoretical convergence guarantee is still an open problem. In this paper, we study the convergence of an existing two-block linearized ADMM and a newly proposed multi-block parallel linearized ADMM for problems with non-convex and non-smooth objectives. Mathematically, we present that the algorithms can converge for a broader class of objective functions under less strict assumptions compared with previous works. Our proposed algorithm can update coupled variables in parallel and work for general non-convex problems, where the traditional ADMM may have difficulties in solving subproblems.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2017-05-06T16:35:08.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "non-convex non-smooth optimization",
      "convergence analysis",
      "general non-convex problems",
      "multi-block parallel linearized admm",
      "great number"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 31,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}