Interior-Point Algorithms for Linear-Programming Decoding

Abstract-- Interior-point algorithms constitute a very interesting class of algorithms for solving linear-programming problems. In this paper we study efficient implementations of such algorithms for solving the linear program that appears in the linearprogramming decoder formulation.

• Type: Journal
• Year: 2008
• Where: CORR
• Authors: Pascal O. Vontobel
• Keywords: Algorithms, CORR 2008, Education, Interesting Class, Interior-point Algorithms