process-improve 2.0.0__tar.gz → 2.1.0__tar.gz

{process_improve-2.0.0 → process_improve-2.1.0}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: process-improve
-Version: 2.0.0
+Version: 2.1.0
 Summary: Designed Experiments; Latent Variables (PCA, PLS, multivariate methods with missing data); Process Monitoring; Batch data analysis.
 Keywords: Designed Experiments,Design of Experiments,DoE,Optimal Design,Response Surface,Latent Variables,PCA,PLS,Multivariate Data Analysis,Chemometrics,Process Monitoring,Batch data analysis
 Author: Kevin Dunn
@@ -10,7 +10,6 @@ Classifier: Development Status :: 4 - Beta
 Classifier: Intended Audience :: Science/Research
 Classifier: Operating System :: OS Independent
 Classifier: Programming Language :: Python :: 3
-Classifier: Programming Language :: Python :: 3.10
 Classifier: Programming Language :: Python :: 3.11
 Classifier: Programming Language :: Python :: 3.12
 Classifier: Programming Language :: Python :: 3.13
@@ -64,7 +63,7 @@ Requires-Dist: matplotlib>=3.10.8 ; extra == 'plotting'
 Requires-Dist: plotly>=6.5.2 ; extra == 'plotting'
 Requires-Dist: ridgeplot>=0.5.0 ; extra == 'plotting'
 Requires-Dist: seaborn>=0.13.2 ; extra == 'plotting'
-Requires-Python: >=3.10
+Requires-Python: >=3.11
 Project-URL: Homepage, https://github.com/kgdunn/process-improve
 Project-URL: Documentation, https://kgdunn.github.io/process-improve/
 Project-URL: Try it in your browser, https://kgdunn.github.io/process-improve/app/
@@ -97,7 +96,7 @@ variable moved, and how sure am I?*
 [![Python versions](https://img.shields.io/python/required-version-toml?tomlFilePath=https%3A%2F%2Fraw.githubusercontent.com%2Fkgdunn%2Fprocess-improve%2Fmain%2Fpyproject.toml&label=python)](https://pypi.org/project/process-improve/)
 [![Downloads](https://static.pepy.tech/badge/process-improve)](https://pepy.tech/project/process-improve)
 [![Downloads per month](https://static.pepy.tech/badge/process-improve/month)](https://pepy.tech/project/process-improve)
-[![CI](https://github.com/kgdunn/process-improve/actions/workflows/run-tests.yml/badge.svg?branch=main&event=push)](https://github.com/kgdunn/process-improve/actions/workflows/run-tests.yml?query=branch%3Amain)
+[![CI](https://github.com/kgdunn/process-improve/actions/workflows/main-status.yml/badge.svg)](https://github.com/kgdunn/process-improve/actions/workflows/run-tests.yml?query=branch%3Amain)
 [![codecov](https://codecov.io/gh/kgdunn/process-improve/branch/main/graph/badge.svg)](https://codecov.io/gh/kgdunn/process-improve)
 [![Docs](https://img.shields.io/badge/docs-kgdunn.github.io-blue.svg)](https://kgdunn.github.io/process-improve/)
 [![License](https://img.shields.io/pypi/l/process-improve.svg)](https://github.com/kgdunn/process-improve/blob/main/LICENSE)
@@ -353,7 +352,7 @@ pip install 'process-improve[fast]'            # adds numba (JIT speedups for ba
 pip install 'process-improve[all]'             # everything above
 ```
 
-Requires Python 3.10 or newer. The core install pulls in `numpy`, `pandas`, `scipy`,
+Requires Python 3.11 or newer. The core install pulls in `numpy`, `pandas`, `scipy`,
 `scikit-learn`, `statsmodels`, `patsy`, `pydantic`, `pyyaml`, `threadpoolctl` and `tqdm`.
 Heavier optional surfaces (plotting, Taguchi arrays, batch IO, batch control, the MCP server, numba JIT)
 live in extras, so a caller who only needs, say, `detect_multivariate_outliers` does not have
@@ -399,6 +398,12 @@ specific version.
 
 MIT: see [LICENSE](https://github.com/kgdunn/process-improve/blob/main/LICENSE) for details.
 
+## Trademarks
+
+OMARS® is a registered trademark of KU Leuven Research & Development. process-improve uses the
+name only for the class of designs defined by Núñez Ares and Goos (2020), and is not affiliated
+with, or endorsed by, KU Leuven, Minitab or Effex.
+
 ## Contributing
 
 Bug reports, feature requests and pull requests are welcome. See

{process_improve-2.0.0 → process_improve-2.1.0}/README.md

@@ -14,7 +14,7 @@ variable moved, and how sure am I?*
 [![Python versions](https://img.shields.io/python/required-version-toml?tomlFilePath=https%3A%2F%2Fraw.githubusercontent.com%2Fkgdunn%2Fprocess-improve%2Fmain%2Fpyproject.toml&label=python)](https://pypi.org/project/process-improve/)
 [![Downloads](https://static.pepy.tech/badge/process-improve)](https://pepy.tech/project/process-improve)
 [![Downloads per month](https://static.pepy.tech/badge/process-improve/month)](https://pepy.tech/project/process-improve)
-[![CI](https://github.com/kgdunn/process-improve/actions/workflows/run-tests.yml/badge.svg?branch=main&event=push)](https://github.com/kgdunn/process-improve/actions/workflows/run-tests.yml?query=branch%3Amain)
+[![CI](https://github.com/kgdunn/process-improve/actions/workflows/main-status.yml/badge.svg)](https://github.com/kgdunn/process-improve/actions/workflows/run-tests.yml?query=branch%3Amain)
 [![codecov](https://codecov.io/gh/kgdunn/process-improve/branch/main/graph/badge.svg)](https://codecov.io/gh/kgdunn/process-improve)
 [![Docs](https://img.shields.io/badge/docs-kgdunn.github.io-blue.svg)](https://kgdunn.github.io/process-improve/)
 [![License](https://img.shields.io/pypi/l/process-improve.svg)](https://github.com/kgdunn/process-improve/blob/main/LICENSE)
@@ -270,7 +270,7 @@ pip install 'process-improve[fast]'            # adds numba (JIT speedups for ba
 pip install 'process-improve[all]'             # everything above
 ```
 
-Requires Python 3.10 or newer. The core install pulls in `numpy`, `pandas`, `scipy`,
+Requires Python 3.11 or newer. The core install pulls in `numpy`, `pandas`, `scipy`,
 `scikit-learn`, `statsmodels`, `patsy`, `pydantic`, `pyyaml`, `threadpoolctl` and `tqdm`.
 Heavier optional surfaces (plotting, Taguchi arrays, batch IO, batch control, the MCP server, numba JIT)
 live in extras, so a caller who only needs, say, `detect_multivariate_outliers` does not have
@@ -316,6 +316,12 @@ specific version.
 
 MIT: see [LICENSE](https://github.com/kgdunn/process-improve/blob/main/LICENSE) for details.
 
+## Trademarks
+
+OMARS® is a registered trademark of KU Leuven Research & Development. process-improve uses the
+name only for the class of designs defined by Núñez Ares and Goos (2020), and is not affiliated
+with, or endorsed by, KU Leuven, Minitab or Effex.
+
 ## Contributing
 
 Bug reports, feature requests and pull requests are welcome. See

{process_improve-2.0.0 → process_improve-2.1.0}/pyproject.toml

@@ -1,10 +1,10 @@
 [project]
 name = "process-improve"
-version = "2.0.0"
+version = "2.1.0"
 description = "Designed Experiments; Latent Variables (PCA, PLS, multivariate methods with missing data); Process Monitoring; Batch data analysis."
 readme = "README.md"
 license = "MIT"
-requires-python = ">=3.10"
+requires-python = ">=3.11"
 keywords = [
     "Designed Experiments",
     "Design of Experiments",
@@ -24,7 +24,6 @@ classifiers = [
     "Intended Audience :: Science/Research",
     "Operating System :: OS Independent",
     "Programming Language :: Python :: 3",
-    "Programming Language :: Python :: 3.10",
     "Programming Language :: Python :: 3.11",
     "Programming Language :: Python :: 3.12",
     "Programming Language :: Python :: 3.13",
@@ -168,6 +167,7 @@ select = ["ALL"]
 ignore = [
     "CPY001",
     "C408",
+    "UP042",
     "ARG001",
     "ANN002",
     "ANN003",

{process_improve-2.0.0 → process_improve-2.1.0}/pyproject.toml.orig

@@ -1,17 +1,16 @@
 [project]
 name = "process-improve"
-version = "2.0.0"
+version = "2.1.0"
 description = 'Designed Experiments; Latent Variables (PCA, PLS, multivariate methods with missing data); Process Monitoring; Batch data analysis.'
 readme = "README.md"
 license = "MIT"
-requires-python = ">=3.10"
+requires-python = ">=3.11"
 keywords = ["Designed Experiments", "Design of Experiments", "DoE", "Optimal Design", "Response Surface", "Latent Variables", "PCA", "PLS", "Multivariate Data Analysis", "Chemometrics", "Process Monitoring", "Batch data analysis"]
 classifiers = [
     "Development Status :: 4 - Beta",
     "Intended Audience :: Science/Research",
     "Operating System :: OS Independent",
     "Programming Language :: Python :: 3",
-    "Programming Language :: Python :: 3.10",
     "Programming Language :: Python :: 3.11",
     "Programming Language :: Python :: 3.12",
     "Programming Language :: Python :: 3.13",
@@ -28,17 +27,18 @@ dependencies = [
     # MCP server, JIT speedups) live in extras; install
     # ``process-improve[all]`` to reproduce the pre-1.24.11 closure.
     "numpy>=2.2.6",
-    # Both pandas majors are supported. pandas 3 needs Python 3.11, so CI's
-    # Python 3.10 jobs test pandas 2.3 and the newer Pythons test pandas 3.
+    # Both pandas majors are supported. CI's Python 3.11 jobs install the lowest
+    # version each dependency allows, so they test pandas 2.3; the newer Pythons
+    # test pandas 3.
     "pandas>=2.3.3",
     "patsy>=1.0.2",
     "pydantic>=2.12.5",
     "pyyaml>=6.0",
     "scikit-learn>=1.7.2",
     # Declared directly because generate_omars solves its ILP with
-    # scipy.optimize.milp (HiGHS). 1.15 is the oldest release CI runs (Python
-    # 3.10 resolves 1.15.3); older releases bundle HiGHS 1.2, which reports a
-    # node-limited stop differently and is not tested here.
+    # scipy.optimize.milp (HiGHS). 1.15 is the oldest release CI runs (the
+    # Python 3.11 jobs resolve 1.15.0); older releases bundle HiGHS 1.2, which
+    # reports a node-limited stop differently and is not tested here.
     "scipy>=1.15",
     "statsmodels>=0.14.6",
     # Already required by scikit-learn; declared because the REML fits of the
@@ -249,6 +249,10 @@ ignore = [
 
     "C408",   # Unnecessary <dict/list/tuple> call - rewrite as a literal. Disagree with this.
 
+    # A `(str, Enum)` class turned into `StrEnum` changes what str() and format()
+    # return for its members, and these enums are public API.
+    "UP042",  # Class inherits from both `str` and `enum.Enum`
+
     # Arguments
     "ARG001", # Unusued argument
 

{process_improve-2.0.0 → process_improve-2.1.0}/src/process_improve/batch/control.py

@@ -528,7 +528,10 @@ def midcourse_correction(  # noqa: PLR0913, PLR0912, PLR0915, C901
     # bisect each active multiplier down so the achieved statistic lands just
     # inside its cap instead of far below it (the escalation overshoots).
     # Each statistic is non-increasing in its own multiplier for this convex
-    # problem, so the per-coordinate bisection is well posed.
+    # problem, so the per-coordinate bisection is well posed. Lowering one
+    # multiplier can raise the other statistic, so a bisection step is taken
+    # only when both caps still hold: every accepted schedule meets both, and
+    # an "ok" status means they hold (#681).
     mu_spe = mu_t2 = 0.0
     n_solves = 0
     u_star = _solve(mu_spe, mu_t2)
@@ -538,6 +541,10 @@ def midcourse_correction(  # noqa: PLR0913, PLR0912, PLR0915, C901
     spe_cap_value = float("inf") if spe_cap is None else float(spe_cap)
     t2_cap_value = float("inf") if t2_cap is None else float(t2_cap)
     cap_status = "ok"
+
+    def _within_caps(spe: float, t2: float) -> bool:
+        return spe <= spe_cap_value * (1 + _CAP_REL_TOL) and t2 <= t2_cap_value * (1 + _CAP_REL_TOL)
+
     for _ in range(30):
         spe_bad = spe_value > spe_cap_value * (1 + _CAP_REL_TOL)
         t2_bad = t2_value > t2_cap_value * (1 + _CAP_REL_TOL)
@@ -561,12 +568,12 @@ def midcourse_correction(  # noqa: PLR0913, PLR0912, PLR0915, C901
                     mid = 0.5 * (low_mu + high_mu)
                     u_try = _solve(mid, mu_t2)
                     n_solves += 1
-                    spe_try, _t2_try = _statistics(u_try)
-                    if spe_try > spe_cap_value * (1 + _CAP_REL_TOL):
+                    spe_try, t2_try = _statistics(u_try)
+                    if not _within_caps(spe_try, t2_try):
                         low_mu = mid
                     else:
                         high_mu = mid
-                        u_star, spe_value, t2_value = u_try, spe_try, _t2_try
+                        u_star, spe_value, t2_value = u_try, spe_try, t2_try
                         if spe_try >= spe_cap_value * (1 - _CAP_REL_TOL):
                             break
                 mu_spe = high_mu
@@ -577,7 +584,7 @@ def midcourse_correction(  # noqa: PLR0913, PLR0912, PLR0915, C901
                     u_try = _solve(mu_spe, mid)
                     n_solves += 1
                     spe_try, t2_try = _statistics(u_try)
-                    if t2_try > t2_cap_value * (1 + _CAP_REL_TOL):
+                    if not _within_caps(spe_try, t2_try):
                         low_mu = mid
                     else:
                         high_mu = mid
@@ -585,9 +592,7 @@ def midcourse_correction(  # noqa: PLR0913, PLR0912, PLR0915, C901
                         if t2_try >= t2_cap_value * (1 - _CAP_REL_TOL):
                             break
                 mu_t2 = high_mu
-            spe_ok = spe_value <= spe_cap_value * (1 + _CAP_REL_TOL)
-            t2_ok = t2_value <= t2_cap_value * (1 + _CAP_REL_TOL)
-            if spe_ok and t2_ok:
+            if _within_caps(spe_value, t2_value):
                 break
 
     scores = b + A_F @ u_star
@@ -610,10 +615,22 @@ def midcourse_correction(  # noqa: PLR0913, PLR0912, PLR0915, C901
                 kind = name.split(":", 1)[0]
                 key = "bounds" if kind == "bound" else "rate"
                 typing.cast("list", active[key]).append(name.split(":", 1)[1])
+
+    def _binding(statistic: str) -> bool:
+        """Return whether a cap holds its statistic down: with its multiplier at zero, the statistic breaks it."""
+        nonlocal n_solves
+        n_solves += 1
+        if statistic == "spe":
+            return _statistics(_solve(0.0, mu_t2))[0] > spe_cap_value * (1 + _CAP_REL_TOL)
+        return _statistics(_solve(mu_spe, 0.0))[1] > t2_cap_value * (1 + _CAP_REL_TOL)
+
+    # A cap is active where its statistic sits at it (within the tolerance), or above it when it
+    # could not be met. Below it, a multiplier left over from the bisection is binding only if
+    # dropping it would break the cap: one bisected down because its cap is slack is not (#681).
     if spe_cap is not None:
-        active["spe_cap"] = bool(mu_spe > 0 or spe_value >= spe_cap_value * (1 - _CAP_REL_TOL))
+        active["spe_cap"] = spe_value >= spe_cap_value * (1 - _CAP_REL_TOL) or (mu_spe > 0 and _binding("spe"))
     if t2_cap is not None:
-        active["t2_cap"] = bool(mu_t2 > 0 or t2_value >= t2_cap_value * (1 - _CAP_REL_TOL))
+        active["t2_cap"] = t2_value >= t2_cap_value * (1 - _CAP_REL_TOL) or (mu_t2 > 0 and _binding("t2"))
 
     return Bunch(
         mv=mv,

{process_improve-2.0.0 → process_improve-2.1.0}/src/process_improve/batch/preprocessing.py

@@ -721,7 +721,7 @@ def one_iteration_dtw(
             aligned_batches[batch_id] = result
             successful_alignments += 1
 
-        except ValueError as exc:  # noqa: PERF203
+        except ValueError as exc:
             # Chain the cause: a band constraint that is too narrow explains itself, and
             # that explanation is the actionable part. `from None` discarded it.
             raise ValueError(f"Failed on batch {batch_id}: {exc}") from exc