gridstate 2.6.0__tar.gz → 2.7.0__tar.gz

{gridstate-2.6.0 → gridstate-2.7.0}/CHANGELOG.md

@@ -9,6 +9,24 @@ types of the merged pull requests; breaking and behavior-changing items are
 listed separately under "Breaking changes" and "Behavior changes". A release is
 cut by tagging the merged main commit; the version is derived from that tag.
 
+## v2.7.0 (2026-10-18)
+
+### Behavior changes
+
+- `ipm_pd` stops the Huber reweighting once the complementarity μ is at or
+  below `huber_freeze_mu` (new solver argument, default 1e-4) and keeps the
+  last weights. Estimates move slightly (≤ 0.005 kV median |ΔV| on the test
+  models, individual nodes up to ~2e-3 p.u.); iteration counts drop.
+
+### Perf
+
+- `ipm_pd` end game with Huber: rows whose residual sits at the threshold
+  flipped their weight every iteration, the merit search halved every other
+  step and the solve zigzagged at a linear rate. Equality rows (the hard
+  transit balance) made it markedly worse: on the test models the hard mode
+  needed up to 109 iterations per solve where the soft one needs 18. With the
+  weights frozen: 28; the hard mode now runs within ~10–15 % of the soft one.
+
 ## v2.6.0 (2026-10-18)
 
 ### Behavior changes

{gridstate-2.6.0 → gridstate-2.7.0}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: gridstate
-Version: 2.6.0
+Version: 2.7.0
 Summary: Power system State Estimation: pure-Python WLS/IPM on numpy/scipy, input via a versioned file contract (npz).
 Author-email: Evgeny Istomin <gena@alpisto.eu>
 License: MIT

{gridstate-2.6.0 → gridstate-2.7.0}/gridstate/_version.py

@@ -18,7 +18,7 @@ version_tuple: tuple[int | str, ...]
 commit_id: str | None
 __commit_id__: str | None
 
-__version__ = version = '2.6.0'
-__version_tuple__ = version_tuple = (2, 6, 0)
+__version__ = version = '2.7.0'
+__version_tuple__ = version_tuple = (2, 7, 0)
 
-__commit_id__ = commit_id = 'ge81a73f8f'
+__commit_id__ = commit_id = 'g9810ca9e9'

{gridstate-2.6.0 → gridstate-2.7.0}/gridstate/algorithms/ipm_pd.py

@@ -244,6 +244,7 @@ def solve_ipm_pd(
     huber_use_mad: bool = False,
     huber_adaptive_k: float = 6.0,
     huber_warmup_iters: int = 5,
+    huber_freeze_mu: float = 1e-4,
     kkt_solver: KKTSolver | None = None,
     eq_prox: float = 1e-9,
     box_prox: float = 1e-6,
@@ -286,6 +287,15 @@ def solve_ipm_pd(
         huber_*: SHGM-IRLS reweighting of the rows of ``huber_mask``, as in
             ``solve_ipm``; the adaptive scale is recomputed every iteration
             (μ changes every iteration).
+        huber_freeze_mu: the reweighting stops once the complementarity μ is
+            at or below it and the last weights are kept. Rows whose residual
+            sits at the Huber threshold flip their weight from one iteration to
+            the next, so the objective the step is computed for changes every
+            iteration and the merit search halves every other step; with the
+            weights frozen the end game is a plain weighted least squares and
+            converges at the Newton rate. Equality rows push the data
+            conflicts into the residuals and make this markedly worse. ``0``
+            reweights to the end.
         kkt_solver: Newton-system solver (``None`` — scipy).
         eq_prox: with equality rows, a proximal term ``eq_prox·max(ρ)`` on the
             diagonal of the box coordinates. A hard balance fixes only the net
@@ -414,8 +424,9 @@ def solve_ipm_pd(
     status = "stalled"
     message = ""
     it = 0
+    mu_last = float("inf")
     for it in range(max_iter):
-        if use_huber and it >= huber_warmup_iters:
+        if use_huber and it >= huber_warmup_iters and mu_last > huber_freeze_mu:
             reweighter.reset_adaptive()
             w = w_base * reweighter.weights(r)
         w_data = np.where(is_eq, 0.0, w)
@@ -423,6 +434,7 @@ def solve_ipm_pd(
         r_l = g[il] - lo[il] - s_l
         r_u = hi[iu] - g[iu] - s_u
         mu = (float(s_l @ y_l) + float(s_u @ y_u)) / n_pairs if n_pairs else 0.0
+        mu_last = mu
         eq_inf = float(np.max(np.abs(c))) if c.size else 0.0
         feas_inf = float(np.max(np.abs(np.concatenate([r_l, r_u])))) if n_pairs else 0.0
         if (

{gridstate-2.6.0 → gridstate-2.7.0}/gridstate.egg-info/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: gridstate
-Version: 2.6.0
+Version: 2.7.0
 Summary: Power system State Estimation: pure-Python WLS/IPM on numpy/scipy, input via a versioned file contract (npz).
 Author-email: Evgeny Istomin <gena@alpisto.eu>
 License: MIT

{gridstate-2.6.0 → gridstate-2.7.0}/gridstate.egg-info/scm_version.json

@@ -1,7 +1,7 @@
 {
-  "tag": "2.6.0",
+  "tag": "2.7.0",
   "distance": 0,
-  "node": "ge81a73f8f85db175e6e502a935ee299b48796dc5",
+  "node": "g9810ca9e90847ed818258672eb84ba159fa60ea2",
   "dirty": false,
   "branch": "HEAD",
   "node_date": "2026-10-18"