sleipnirgroup-jormungandr 0.6.7.dev29__tar.gz → 0.6.7.dev31__tar.gz

{sleipnirgroup_jormungandr-0.6.7.dev29 → sleipnirgroup_jormungandr-0.6.7.dev31}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: sleipnirgroup-jormungandr
-Version: 0.6.7.dev29
+Version: 0.6.7.dev31
 Summary: Reverse mode autodiff library and NLP solver DSL
 License-Expression: BSD-3-Clause
 License-File: LICENSE.txt

{sleipnirgroup_jormungandr-0.6.7.dev29 → sleipnirgroup_jormungandr-0.6.7.dev31}/python/src/sleipnir/__init__.py

@@ -2,4 +2,4 @@
 
 from ._sleipnir import *
 
-__version__ = "0.6.7.dev29"
+__version__ = "0.6.7.dev31"

{sleipnirgroup_jormungandr-0.6.7.dev29 → sleipnirgroup_jormungandr-0.6.7.dev31}/python/test/optimization/nonlinear_problem_test.py

@@ -81,8 +81,8 @@ def test_rosenbrock_with_disk_constraint():
 
             assert problem.solve() == ExitStatus.SUCCESS
 
-            assert x.value() == pytest.approx(1.0, abs=1e-3)
-            assert y.value() == pytest.approx(1.0, abs=1e-3)
+            sol = (x.value(), y.value())
+            assert sol == pytest.approx((1.0, 1.0), abs=1e-3)
 
 
 def test_minimum_2d_distance_with_linear_constraint():
@@ -124,7 +124,9 @@ def test_conflicting_bounds():
 
 
 def test_wachter_and_biegler_line_search_failure():
-    # See example 19.2 of [1]
+    # Example 19.2 of [1] exercises a deficiency of line search IPMs that must
+    # be overcome by feasibility restoration. Depending on the specific
+    # trajectory taken, either success or local infeasibility are expected.
     #
     # [1] Nocedal, J. and Wright, S. "Numerical Optimization", 2nd. ed., Ch. 19.
     #     Springer, 2006.
@@ -147,8 +149,14 @@ def test_wachter_and_biegler_line_search_failure():
     assert problem.equality_constraint_type() == ExpressionType.QUADRATIC
     assert problem.inequality_constraint_type() == ExpressionType.LINEAR
 
-    assert problem.solve(diagnostics=True) == ExitStatus.SUCCESS
-
-    assert x.value() == pytest.approx(1.0, abs=1e-6)
-    assert s1.value() == pytest.approx(0.0, abs=1e-6)
-    assert s2.value() == pytest.approx(0.5, abs=1e-6)
+    status = problem.solve(diagnostics=True)
+    assert status in (ExitStatus.SUCCESS, ExitStatus.LOCALLY_INFEASIBLE)
+
+    if status == ExitStatus.SUCCESS:
+        assert x.value() == pytest.approx(1.0, abs=1e-6)
+        assert s1.value() == pytest.approx(0.0, abs=1e-6)
+        assert s2.value() == pytest.approx(0.5, abs=1e-6)
+    else:
+        assert x.value() == pytest.approx(-1.0, abs=1e-6)
+        assert s1.value() == pytest.approx(0.0, abs=1e-6)
+        assert s2.value() == pytest.approx(0.0, abs=3e-5)