Interior-point algorithms for linear-programming decoding

2008 Information Theory and Applications Workshop - Conference Proceedings, ITA

Volumn , Issue , 2008, Pages 433-437

  Vontobel, Pascal O ^a  

^a HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CYBERNETICS; DECODING; INFORMATION THEORY; LEARNING SYSTEMS; MATHEMATICAL MODELS;

INTERIOR-POINT ALGORITHMS; LINEAR PROGRAM; LINEAR-PROGRAMMING DECODING; PROGRAMMING PROBLEMS;

LINEAR PROGRAMMING;

EID: 52949094631     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITA.2008.4601085     Document Type: Conference Paper

References (34)

1. J. Feldman, "Decoding error-correcting codes via linear programming," Ph.D. dissertation, Massachusetts Institute of Technology, Cambridge, MA, 2003, available online under http://www.columbia.edu/~jf2189/ pubs.html.
2. J. Feldman, M. J. Wainwright, and D. R. Karger, "Using linear programming to decode binary linear codes," IEEE Trans. on Inform. Theory, vol. IT-51, no. 3, pp. 954-972, May 2005.
3. R. Koetter and P. O. Vontobel, "Graph covers and iterative decoding of finite-length codes," in Proc. 3rd Intern. Symp. on Turbo Codes and Related Topics, Brest, France, Sept. 1-5 2003, pp. 75-82.
4. P. O. Vontobel and R. Koetter, "Graph-cover decoding and finite-length analysis of message-passing iterative decoding of LDPC codes," accepted for IEEE Trans. Inform. Theory, available online under http://www. arxiv.org/abs/cs.IT/0512078, 2007.
5. _, "On the relationship between linear programming decoding and min-sum algorithm decoding," in Proc. Intern. Symp. on Inform. Theory and its Applications (ISITA), Parma, Italy, Oct. 10-13 2004, pp. 991-996.
6. J. Feldman, D. R. Karger, and M. J. Wainwright, "Linear programming-based decoding of turbo-like codes and its relation to iterative approaches," in Proc. 40th Allerton Conf. on Communications, Control, and Computing, Allerton House, Monticello, Illinois, USA, October 2-4 2002, available online under http ://www.columbia.edu/~jf2189/pubs.html.
7. K. Yang, X. Wang, and J. Feldman, "Non-linear programming approaches to decoding low-density parity-check codes," in Proc. 43rd Allerton Conf. on Communications, Control, and Computing, Allerton House, Monticello, Illinois, USA, Sep. 28-30 2005.
8. _, "Fast ML decoding of SPC product code by linear programming decoding," in Proc. IEEE GLOBECOM, Washington, DC, USA, Nov. 26-30 2007, pp. 1577-1581.
9. M. H. Taghavi and P. H. Siegel, "Adaptive linear programming decoding," in Proc. IEEE Intern. Symp. on Inform. Theory, Seattle, WA, USA, July 9-14 2006, pp. 1374-1378.
10. P. O. Vontobel and R. Koetter, "On low-complexity linear-programming decoding of LDPC codes," Europ. Trans. on Telecomm., vol. 5, pp. 509-517, Aug. 2007.
11. A. G. Dimakis and M. J. Wainwright, "Guessing facets: polytope structure and improved LP decoder," in Proc. IEEE Intern. Symp. on Inform. Theory, Seattle, WA, USA, July 9-14 2006, pp. 1369-1373.
12. S. C. Draper, J. S. Yedidia, and Y. Wang, "ML decoding via mixed-integer adaptive linear programming," in Proc. IEEE Intern. Symp. on Inform. Theory, Nice, France, June 24-29 2007, pp. 1656-1660.
13. M. H. Taghavi and P. H. Siegel, "Equalization on graphs: linear programming and message passing," in Proc. IEEE Intern. Symp. on Inform. Theory, Nice, France, June 24-29 2007, pp. 2551-2555.
14. T. Wadayama, "Interior point decoding for linear vector channels," submitted, available online under http://arxiv.org/abs/ 0705.3990, May 2007.
15. N. Karmarkar, "A new polynomial-time algorithm for linear programming," Combinatorica, vol. 4, no. 4, pp. 373-395, Dec. 1984.
16. I. I. Dikin, "Iterative solution of problems of linear and quadratic programming," Soviet Math. Doklady, vol. 8, pp. 674-675, 1967.
17. D. Bertsekas, Nonlinear Programming, 2nd ed. Belmont, MA: Athena Scientific, 1999.
18. D. Bertsimas and J. N. Tsitsiklis, Linear Optimization. Belmont, MA: Athena Scientific, 1997.
19. T. Tsuchiya, "Global convergence of the affine scaling methods for degenerate linear programming problems," Math. Progr., vol. 52, no. 3, pp. 377-404, May 1991.
20. T. Tsuchiya and M. Muramatsu, "Global convergence of a long-step affine scaling algorithm for degenerate linear programming problems," SIAM J. Opt., vol. 5, no. 3, pp. 525-551, Aug. 1995.
21. R. Saigal, "A simple proof of a primal affine scaling method," Ann, Oper. Res., vol. 62, pp. 303-324, 1996.
22. I. Adler and R. D. C. Monteiro, "Limiting behavior of the affine scaling continuous trajectories for linear programming problems," Math. Progr, vol. 50, no. 1, pp. 29-51, Mar. 1991.
23. S. J. Wright, Primal-Dual Interior-Point Methods. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM), 1997.
24. M. R. Hestenes and E. Stiefel, "Methods of conjugate gradients for solving linear systems," Journal of Research of the National Bureau of Standards, vol. 49, 1952.
25. J. R. Shewchuk, An introduction to the conjugate gradient method without the agonizing pain. Technical Report, Carnegie Mellon University, Pittsburgh, PA, 1994.
26. M. G. C. Resende and G. Veiga, "An implementation of the dual affine scaling algorithm for minimum-cost flow on bipartite uncapacitated networks," SIAM Journal on Optimization, vol. 3, no. 3, pp. 516-537, 1993.
27. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. on Inform. Theory, vol. IT-47, no. 2, pp. 498-519, Feb. 2001.
28. G. D. Forney, Jr., "Codes on graphs: normal realizations," IEEE Trans. on Inform. Theory, vol. IT-47, no. 2, pp. 520-548, Feb. 2001.
29. H.-A. Loeliger, "An introduction to factor graphs," IEEE Sig. Proc. Mag., vol. 21, no. 1, pp. 28-41, Jan. 2004.
30. D. M. Malioutov and J. K. Johnson and A. S. Willsky, "Walk-sums and belief propagation in Gaussian graphical models," J. Mach. Learn. Res., vol. 7, pp. 2031-2064, Dec. 2006.
31. C. C. Moallemi and B. Van Roy, "Convergence of the min-sum message passing algorithm for quadratic optimization," submitted, Mar. 2006.
32. _, "Convergence of the min-sum algorithm for convex optimization," submitted, May 2007.
33. M. Chertkov and M. Stepanov, "Pseudo-codeword landscape," in Proc. IEEE Intern. Symp. on Inform. Theory, Nice, France, June 24-29 2007, pp. 1546-1550.
34. K. Yang, X. Wang, and J. Feldman, "Cascaded formulation of the fundamental polytope of general linear block codes," in Proc. IEEE Intern. Symp. on Inform. Theory, Nice, France, June 24-29 2007, pp. 1361-1365.