From 8b2f2703dba5abd694aaa966fdbc3ddb3354de43 Mon Sep 17 00:00:00 2001 From: Andreas Tsouchlos Date: Thu, 13 Apr 2023 01:41:04 +0200 Subject: [PATCH] Fixed LP -> ML --- latex/thesis/chapters/lp_dec_using_admm.tex | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/latex/thesis/chapters/lp_dec_using_admm.tex b/latex/thesis/chapters/lp_dec_using_admm.tex index 29e55ee..0fc7bf5 100644 --- a/latex/thesis/chapters/lp_dec_using_admm.tex +++ b/latex/thesis/chapters/lp_dec_using_admm.tex @@ -11,8 +11,8 @@ TODO \Ac{LP} decoding is a subject area introduced by Feldman et al. \cite{feldman_paper}. They reframe the decoding problem as an \textit{integer linear program} and subsequently present two relaxations into -\textit{linear programs}, one representing a formulation of exact \ac{LP} -decoding and one, which is an approximation with a more manageable +\textit{linear programs}, one representing an \ac{LP} formulation of exact +\ac{ML} decoding and one, which is an approximation with a more manageable representation. To solve the resulting linear program, various optimization methods can be used (see for example \cite{alp}, \cite{interior_point},