an.tsouchlos/ba-thesis
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases 1 Wiki Activity

Renamed theoretical comparison section

Browse Source
This commit is contained in:
Andreas Tsouchlos 2023-04-01 19:31:02 +02:00
parent b0c66bb454
commit 848ec4469f
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
latex/thesis/chapters/analysis_of_results.tex
View File

@ -30,8 +30,8 @@
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\section{Comparison of the Proximal Decoding and LP Decoding using ADMM algorithms}%
\label{sec:Comparison of the Proximal Decoding and LP Decoding using ADMM algorithms}
\section{Theoretical Comparison of Proximal Decoding and LP Decoding using ADMM}%
\label{sec:Theoretical Comparison of Proximal Decoding and LP Decoding using ADMM}
In this section, some similarities between the proximal decoding algorithm
and \ac{LP} decoding using \ac{ADMM} are be pointed out.
@ -123,8 +123,8 @@ codeword was sent and one associated to the constraints the codeword is
subjected to.
Their major difference is that the two parts of the objective minimized with
proximal decoding are both functions of the same variable
$\tilde{\boldsymbol{x}}$, whereas with \ac{ADMM} the two parts depend on
different variables: $\tilde{\boldsymbol{c}}$ and $\boldsymbol{z}$.
$\tilde{\boldsymbol{x}}$, whereas with \ac{ADMM} the two parts are functions
of different variables: $\tilde{\boldsymbol{c}}$ and $\boldsymbol{z}$.
This difference means that while with proximal decoding the alternating
minimization of the two parts of the objective function inevitably leads to
oscillatory behaviour (as explained in section (TODO)), this is not the