From fe099e36696e8b5bb681bd8b3be7a30fa08fa3b9 Mon Sep 17 00:00:00 2001
From: beckyperriment <93582518+beckyperriment@users.noreply.github.com>
Date: Thu, 25 Apr 2024 13:31:35 +0100
Subject: [PATCH] Update paper.md

---
 joss/paper.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/joss/paper.md b/joss/paper.md
index c7a9d17..8bc53d9 100644
--- a/joss/paper.md
+++ b/joss/paper.md
@@ -99,7 +99,7 @@ Using this distance matrix, $D$, the full set of time series can be split into $
 As each centroid has to be in its own cluster, non-zero diagonal entries in $A$ represent centroids. Our objective is to find $A$, and this may be formulated as an optimisation problem
 
 \begin{equation}
-    A^\star = \underset{\rm argmin}{A} \sum_i \sum_j D_{ij} \times A_{ij},
+    A^\star = \underset{A}{\rm argmin} \sum_i \sum_j D_{ij} \times A_{ij},
 \end{equation}
 
 subject to the following constrants: