On the convergence time of a natural dynamics for linear programming

DOI10.1007/s00453-019-00615-3zbMath1441.90089OpenAlexW2551175713WikidataQ127390531 ScholiaQ127390531MaRDI QIDQ1986962

Vincenzo Bonifaci

Publication date: 9 April 2020

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/8227/

zbMATH Keywords

linear programmingrelative entropymirror descentnatural algorithmphysarum dynamics

Mathematics Subject Classification ID

Linear programming (90C05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Information geometry and its applications
• Mirror descent and nonlinear projected subgradient methods for convex optimization.
• Physarum can compute shortest paths: a short proof
• A mathematical model for adaptive transport network in path finding by true slime mold
• A Slime Mold Solver for Linear Programming Problems
• Rules for Biologically Inspired Adaptive Network Design
• The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
• Evolutionary Games and Population Dynamics
• Natural Algorithms for Flow Problems
• On the Convergence Time of a Natural Dynamics for Linear Programming
• Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds
• The Information Geometry of Mirror Descent

This page was built for publication: On the convergence time of a natural dynamics for linear programming