Added lautern citation
This commit is contained in:
parent
0e84d596c0
commit
5efdea242c
@ -110,3 +110,14 @@
|
||||
doi={10.1109/TIT.2004.842696}
|
||||
}
|
||||
|
||||
@ARTICLE{lautern,
|
||||
author={Gensheimer, Florian and Dietz, Tobias and Kraft, Kira and Ruzika, Stefan and Wehn, Norbert},
|
||||
journal={IEEE Transactions on Information Theory},
|
||||
title={A Reduced-Complexity Projection Algorithm for ADMM-Based LP Decoding},
|
||||
year={2020},
|
||||
volume={66},
|
||||
number={8},
|
||||
pages={4819-4833},
|
||||
doi={10.1109/TIT.2020.2984247}
|
||||
}
|
||||
|
||||
|
||||
@ -13,6 +13,8 @@
|
||||
\item Test the (Alternating Direction Method of Multipliers) ADMM
|
||||
as an optimization method for LP Decoding
|
||||
\begin{itemize}
|
||||
\item In LP decoding, the ML decoding problem is reduced to a linear program,
|
||||
which can be solved in polynomial time \cite{lautern}
|
||||
\item ADMM is intended to blend the decomposability
|
||||
of dual ascent with the superior convergence properties of the method
|
||||
of multipliers \cite{distr_opt_book}
|
||||
|
||||
Loading…
Reference in New Issue
Block a user