Added bibliography entry for original ADMM paper
This commit is contained in:
@@ -692,9 +692,9 @@ The resulting formulation of the relaxed optimization problem becomes:%
|
||||
\begin{itemize}
|
||||
\item Distributed nature, making it a competitor to BP
|
||||
(which can also be implemented in a distributed manner)
|
||||
(See original ADMM paper)
|
||||
\cite[Sec. I]{original_admm}
|
||||
\item Computational performance similar to BP has been demnonstrated
|
||||
(See original ADMM paper)
|
||||
\cite[Sec. I]{original_admm}
|
||||
\end{itemize}
|
||||
\item Adaptive linear programming?
|
||||
\item How ADMM is adapted to LP decoding
|
||||
|
||||
@@ -6,10 +6,10 @@
|
||||
\item Problem definition
|
||||
\item Motivation
|
||||
\begin{itemize}
|
||||
\item Error floor when decoding with BP (seems to not be persent with LP decoding -
|
||||
see original ADMM paper introduction)
|
||||
\item Error floor when decoding with BP (seems to not be persent with LP decoding
|
||||
\cite[Sec. I]{original_admm})
|
||||
\item Strong theoretical guarantees that allow for better and better approximations
|
||||
for ML decoding (See original ADMM peper introduction)
|
||||
for ML decoding \cite[Sec. I]{original_admm}
|
||||
\end{itemize}
|
||||
\item Results summary
|
||||
\end{itemize}
|
||||
|
||||
Reference in New Issue
Block a user