---
title: 'SP-ADMM-JCNL: Joint Localization in WSNs'
url: https://www.emergentmind.com/topics/sp-admm-jcnl
type: topic
---

# SP-ADMM-JCNL: Joint Localization in WSNs

SP-ADMM-JCNL denotes the **Scaled Proximal Alternating Direction Method of Multipliers for Joint Cooperative and Non-Cooperative Localization**, a distributed optimization method for wireless sensor networks (WSNs) in which sensor self-localization and passive target localization are posed and solved as a single optimization problem. Its defining features are a joint modeling of cooperative and non-cooperative localization, an auxiliary-variable reformulation that structurally decouples the resulting non-convex and non-smooth objective, and a scaled proximal ADMM scheme whose iterates are shown to converge globally to a Karush-Kuhn-Tucker (KKT) point of the reformulated problem and to a critical point of the original non-convex objective function, with a sublinear rate of $O(1/T)$ [2509.18213].

## 1. Joint localization setting

SP-ADMM-JCNL is designed for the setting in which **cooperative localization** and **non-cooperative localization** arise simultaneously in a WSN. In the terminology used in the source work, cooperative localization refers to collaborative estimation of sensor positions, typically aided by anchors whose positions are known, whereas non-cooperative localization refers to estimation of a passive external target that does not communicate with the network [2509.18213].

The motivation for a joint treatment is operational as well as algorithmic. Sequential treatment, denoted **SCNL** in the source summary, first localizes the sensors and only then estimates the target. The joint formulation, denoted **JCNL**, eliminates the delay in target estimation that is intrinsic to such sequential pipelines. It also allows sensor-position inference to benefit from target-related measurements, so that all positions are estimated consistently and concurrently. The paper characterizes the resulting optimization as having **complex variable coupling**, which is the central technical obstacle addressed by the method [2509.18213].

The network model consists of sensors indexed by $\mathcal{N}=\{1,\dots,N\}$, a subset of anchors $\mathcal{A}\subset\mathcal{N}$ with known positions, an unknown target position $\mathbf{y}\in\mathbb{R}^n$, and an undirected, connected graph $G=(\mathcal{N},\mathcal{E})$. The measurements are noisy inter-sensor ranges
\[
d_{i,j}=\|\mathbf{x}_i-\mathbf{x}_j\|+\omega_{i,j},
\]
and noisy sensor-target ranges
\[
r_i=\|\mathbf{x}_i-\mathbf{y}\|+\tau_i,
\]
with $\omega_{i,j}$ and $\tau_i$ modeled as i.i.d. Gaussian noise [2509.18213].

## 2. Optimization model and JCNL formulation

The maximum likelihood estimator underlying SP-ADMM-JCNL minimizes
\[
\frac{1}{2}\sum_{i\in\mathcal{N}} f_i(\mathbf{x},\mathbf{y})
\]
subject to anchor constraints $\mathbf{x}_k=\mathbf{a}_k$ for all $k\in\mathcal{A}$, where the local term is
\[
f_i(\mathbf{x},\mathbf{y})=
\sum_{j\in\mathcal{N}_i}\left(\|\mathbf{x}_i-\mathbf{x}_j\|-d_{i,j}\right)^2
+
\left(\|\mathbf{x}_i-\mathbf{y}\|-r_i\right)^2.
\]
The paper describes this objective as **non-convex**, **non-smooth**, and tightly coupled across variables [2509.18213].

That description is consequential. Non-convexity enters through the geometry of range-based localization, non-smoothness through Euclidean norms, and tight coupling through simultaneous dependence on neighboring sensor positions and the target position. A straightforward distributed ADMM application is therefore obstructed both by local non-smooth terms and by the fact that each node’s variables are entangled with those of its neighbors and with the target estimate.

A compact comparison between the joint and sequential viewpoints used in the paper is given below.

| Aspect | JCNL (Joint) | SCNL (Separate) |
|---|---|---|
| Modeling | Joint estimation of sensors and target | Two-stage: sensors, then target |
| Optimization | Single least-squares problem | Sequential least-squares problems |
| Information flow | Target data aids sensor localization | Used only after sensor localization |
| Target estimation timeliness | Real-time with sensors | Waits for sensor positions first |

This comparison clarifies a common misconception. The point of JCNL is not merely to bundle two tasks into one larger objective. Rather, the formulation changes the information flow: target measurements enter the sensor-position inference itself. A plausible implication is that the gain is structural, not only procedural.

## 3. Structural decoupling and constrained smooth reformulation

The reformulation begins with a variational treatment of the norm terms. For inter-sensor differences,
\[
\|\mathbf{x}_i-\mathbf{x}_j\|
=
\max_{\mathbf{v}_{i,j}\in\mathcal{B}}
\mathbf{v}_{i,j}^\top(\mathbf{x}_i-\mathbf{x}_j),
\]
and an analogous representation is used for $\|\mathbf{x}_i-\mathbf{y}\|$, where $\mathcal{B}$ is the unit ball. In the source summary this is described as a dual representation using the Cauchy-Schwarz inequality. The effect is to transform the non-smooth loss into a bilinear coupling with convex bound constraints [2509.18213].

A second layer of reformulation introduces **local copies** and **auxiliary consensus variables**. For node $i$, examples include $\mathbf{p}_{i,j}^+$, node $i$’s local copy of neighbor $j$’s position, and $\mathbf{q}_{i,j}^+$, node $i$’s local copy of neighbor $j$’s estimate of the target. The stacked local block is
\[
\mathbf{z}_i=
\begin{bmatrix}
\mathbf{x}_i\\
\mathbf{p}_i^-\\
\mathbf{p}_i^+\\
\mathbf{y}_i\\
\mathbf{q}_i^-\\
\mathbf{q}_i^+
\end{bmatrix}
\in\mathbb{R}^{(4N_i+2)n}.
\]
Consensus constraints enforce agreement among local views, including neighbor consistency and target-consensus relations such as $\mathbf{y}_i=\mathbf{y}_j$ for neighbors [2509.18213].

After substitution, the problem is written in the condensed form
\[
\min_{\mathbf{z},\mathbf{w}}
\sum_{i\in\mathcal{N}}
\left[
\frac{1}{2}\|\mathbf{H}_i\mathbf{z}_i\|^2
-
\mathbf{w}_i^\top \mathbf{D}_i\mathbf{H}_i\mathbf{z}_i
+
\delta_{\mathcal{B}^{N_i+1}}(\mathbf{w}_i)
\right]
\]
subject to
\[
\mathbf{A}_i\mathbf{z}_i=0,\quad
\mathbf{z}\in\mathcal{X}\ \text{(anchor constraints)},\quad
\mathbf{z}\in\mathcal{Y}\ \text{(consensus constraints)}.
\]
Here $\mathbf{H}_i$, $\mathbf{A}_i$, and $\mathbf{D}_i$ are structured matrices encoding the local geometry and consistency relations, and $\delta_{\mathcal{B}^{N_i+1}}$ is the indicator function of the corresponding unit-ball constraint set [2509.18213].

This reformulation is central to the algorithm’s identity. It is “smooth and constrained” in the sense that the problematic norm terms have been transferred into auxiliary-variable constraints and bilinear interactions, while separability is recovered at the node level except for the explicit consensus structure.

## 4. Scaled proximal ADMM iteration

SP-ADMM-JCNL applies a distributed augmented-Lagrangian scheme over the reformulated variables. For each node $i$ and iteration $t$, the method performs a primal update, an auxiliary-variable update, and a dual update [2509.18213].

The primal step is
\[
\mathbf{z}_i^{t+1}
=
\arg\min_{\mathbf{z}_i\in\mathcal{X}\cap\mathcal{Y}}
\mathcal{L}_i\!\left(\mathbf{z}_i,\mathbf{w}_i^t,\boldsymbol{\lambda}_i^t\right)
+
\frac{c}{2}\|\mathbf{z}_i-\mathbf{z}_i^t\|_{\mathbf{B}_i^\top\mathbf{B}_i}^2,
\]
where $\mathcal{L}_i$ is the local augmented Lagrangian, $c$ is a penalty parameter, and $\mathbf{B}_i$ is a selection matrix chosen so that the update is easy to solve and the subproblem is strongly convex. The source summary explicitly describes this as a **diagonalization trick** yielding closed-form updates through the structure of $\mathbf{B}_i$ [2509.18213].

The auxiliary-variable step is a projection:
\[
\mathbf{w}_i^{t+1}
=
\mathrm{Proj}_{\mathcal{B}^{N_i+1}}
\left(
\mathbf{w}_i^t+\frac{1}{\rho}\mathbf{D}_i\mathbf{H}_i\mathbf{z}_i^{t+1}
\right),
\]
with $\rho$ a penalty parameter. The dual variable is then updated by
\[
\boldsymbol{\lambda}_i^{t+1}
=
\boldsymbol{\lambda}_i^t+c\,\mathbf{A}_i\mathbf{z}_i^{t+1}.
\]

The resulting algorithm is distributed in the precise sense that all updates are local except for exchanges with neighboring nodes. The paper states that each update depends only on local and neighbor variables and that the full procedure is specified in Algorithm 1, including communication steps [2509.18213].

From an algorithmic standpoint, the qualifier **scaled proximal** has a specific role. The proximal regularization term strengthens the subproblems and stabilizes the non-convex ADMM iteration, while the scaling embodied in $\mathbf{B}_i^\top\mathbf{B}_i$ is selected to make the local solve explicit or at least structurally simple.

## 5. Convergence analysis and interpretive scope

The convergence theory provided for SP-ADMM-JCNL is global in the sense used in non-convex optimization: the algorithm generates a sequence converging to a **KKT point** of the reformulated problem and to a **critical point** of the original non-convex objective. The reported rate is **sublinear**, specifically $O(1/T)$ in terms of the optimality gap [2509.18213].

The analysis introduces stationarity, feasibility, and update-gap measures to track progress. For any pre-specified accuracy $\epsilon_1$, the paper states that the number of iterations $T$ required to reach $\mathcal{G}\leq \epsilon_1$ satisfies
\[
\epsilon_1 \leq \frac{\epsilon_2}{T-1},
\]
which is the stated form of the $O(1/T)$ bound. The proof strategy described in the summary combines a potential function, monotonic descent and boundedness arguments, subgradient and stationarity-gap estimates, and the Kurdyka-Łojasiewicz property for semi-algebraic functions. The assumptions include boundedness, network connectivity, and parameter choices ensuring sufficient descent and strong convexity of the subproblems [2509.18213].

Two clarifications are important for interpretation. First, the guarantee is to KKT and critical points, not to a globally optimal solution of the non-convex localization problem. Second, the guarantee pertains to the **reformulated** constrained problem and is then transferred back to the original objective through the equivalence established by the auxiliary-variable construction. The source summary also notes a limiting case: when all nodes are anchors, the approach reduces to standard non-cooperative localization, and the guarantees still hold [2509.18213].

## 6. Empirical behavior and relation to prior SP-ADMM localization methods

The numerical evaluation reported for SP-ADMM-JCNL uses both synthetic and benchmark data. In a synthetic setup with **100 agents, 8 anchors, and 1 target in $[0,1]^2$**, under two measurement noise models—**AWGN** and **range-dependent**—the paper tracks **RMSE** for sensors and target, together with **stationarity gap** and **feasibility gap**. The reported behavior is that both sensor and target RMSE converge quickly and accurately, the feasibility and stationarity gaps decrease rapidly in line with the predicted $O(1/T)$ rate, and the estimated and true positions overlap closely [2509.18213].

On the benchmark dataset **test10-500 from Stanford**, the joint method is compared with a separate two-stage baseline denoted **SP-ADMM-SCNL**. The reported runtime is **0.0955s** for JCNL against **0.1489s** for SCNL. The joint method also achieves lower sensor and target localization RMSE, avoids target-estimation latency, and exhibits better error performance throughout the optimization rather than only at termination [2509.18213].

These results place SP-ADMM-JCNL within a broader line of distributed localization methods based on scaled proximal ADMM. Earlier work on **distributed cooperative localization in WSNs** reformulated the classic cooperative localization problem as a smooth and constrained nonconvex minimization problem with node-separable loss, and proposed distributed SP-ADMM algorithms that globally converge to a KKT point and a critical point of the original problem with a favorable sublinear $\mathcal{O}(1/T)$ convergence rate [2208.12005]. SP-ADMM-JCNL inherits the same broad design principles—smooth constrained reformulation, nodewise separability, proximal stabilization, and distributed multiplier updates—but applies them to the strictly richer JCNL setting in which sensor localization and passive target localization are solved simultaneously [2509.18213].

In that sense, SP-ADMM-JCNL is best understood not as a generic ADMM variant with a new acronym, but as a localization-specific distributed method whose distinctive contribution lies in making **joint cooperative and non-cooperative localization** computationally tractable while preserving explicit per-node updates and non-convex convergence guarantees.

Source: https://www.emergentmind.com/topics/sp-admm-jcnl