{
  "id": "1502.06784",
  "version": "v1",
  "published": "2015-02-24T12:35:55.000Z",
  "updated": "2015-02-24T12:35:55.000Z",
  "title": "Asynchronous Algorithms for Linear Programs",
  "authors": [
    "Tarek A. Lahlou",
    "Thomas A. Baran"
  ],
  "categories": [
    "math.OC"
  ],
  "abstract": "In this paper we design and analyze algorithms for asynchronously solving linear programs using nonlinear signal processing structures. In particular, we discuss a general procedure for generating these structures such that a fixed-point of the structure is within a change of basis the minimizer of an associated linear program. We discuss methods for organizing the computation into distributed implementations and provide a treatment of convergence. The presented algorithms are accompanied by numerical simulations of the Chebyshev center and basis pursuit problems.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2015-02-24T12:35:55.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "asynchronous algorithms",
      "basis pursuit problems",
      "nonlinear signal processing structures",
      "chebyshev center",
      "asynchronously solving linear programs"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}