License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ISAAC.2017.17
URN: urn:nbn:de:0030-drops-82274
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2017/8227/
Go to the corresponding LIPIcs Volume Portal

Bonifaci, Vincenzo

On the Convergence Time of a Natural Dynamics for Linear Programming

pdf-format:
LIPIcs-ISAAC-2017-17.pdf (0.4 MB)

Abstract

We consider a system of nonlinear ordinary differential equations for the solution of linear programming (LP) problems that was first proposed in the mathematical biology literature as a model for the foraging behavior of acellular slime mold Physarum polycephalum, and more recently considered as a method to solve LP instances. We study the convergence time of the continuous Physarum dynamics in the context of the linear programming problem, and derive a new time bound to approximate optimality that depends on the relative entropy between projected versions of the optimal point and of the initial point. The bound scales logarithmically with the LP cost coefficients and linearly with the inverse of the relative accuracy, establishing the efficiency of the dynamics for arbitrary LP instances with positive costs.

BibTeX - Entry

@InProceedings{bonifaci:LIPIcs:2017:8227,
  author =	{Vincenzo Bonifaci},
  title =	{{On the Convergence Time of a Natural Dynamics for Linear Programming}},
  booktitle =	{28th International Symposium on Algorithms and Computation (ISAAC 2017)},
  pages =	{17:1--17:12},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-054-5},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{92},
  editor =	{Yoshio Okamoto and Takeshi Tokuyama},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/8227},
  URN =		{urn:nbn:de:0030-drops-82274},
  doi =		{10.4230/LIPIcs.ISAAC.2017.17},
  annote =	{Keywords: linear programming, natural algorithm, Physarum polycephalum, relative entropy, Mirror Descent}
}

Keywords: linear programming, natural algorithm, Physarum polycephalum, relative entropy, Mirror Descent
Collection: 28th International Symposium on Algorithms and Computation (ISAAC 2017)
Issue Date: 2017
Date of publication: 07.12.2017

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI