sleipnirgroup-jormungandr 0.1.1.dev111__cp312-cp312-manylinux_2_39_aarch64.whl → 0.1.1.dev113__cp312-cp312-manylinux_2_39_aarch64.whl

jormungandr/test/autodiff/hessian_test.py

@@ -187,10 +187,7 @@ def test_sum_of_squares():
     for i in range(4):
         x[i].set_value(0.0)
 
-    J = 0.0
-    for i in range(4):
-        J += (r[i] - x[i]) * (r[i] - x[i])
-
+    J = sum((r[i] - x[i]) * (r[i] - x[i]) for i in range(4))
     H = Hessian(J, x)
 
     expected_H = np.diag([2.0] * 4)

jormungandr/test/optimization/arm_on_elevator_problem_test.py

@@ -84,12 +84,13 @@ def test_arm_on_elevator_problem():
         problem.subject_to(heights <= END_EFFECTOR_MAX_HEIGHT)
 
     # Cost function
-    J = 0.0
-    for k in range(N + 1):
-        J += (ELEVATOR_END_HEIGHT - elevator[0, k]) ** 2 + (
-            ARM_END_ANGLE - arm[0, k]
-        ) ** 2
-    problem.minimize(J)
+    problem.minimize(
+        sum(
+            (ELEVATOR_END_HEIGHT - elevator[0, k]) ** 2
+            + (ARM_END_ANGLE - arm[0, k]) ** 2
+            for k in range(N + 1)
+        )
+    )
 
     assert problem.cost_function_type() == ExpressionType.QUADRATIC
     assert problem.equality_constraint_type() == ExpressionType.LINEAR

jormungandr/test/optimization/cart_pole_ocp_test.py

@@ -73,10 +73,7 @@ def test_cart_pole_ocp():
     U = problem.U()
 
     # Minimize sum squared inputs
-    J = 0.0
-    for k in range(N):
-        J += U[:, k : k + 1].T @ U[:, k : k + 1]
-    problem.minimize(J)
+    problem.minimize(sum(U[:, k : k + 1].T @ U[:, k : k + 1] for k in range(N)))
 
     assert problem.cost_function_type() == ExpressionType.QUADRATIC
     assert problem.equality_constraint_type() == ExpressionType.NONLINEAR

jormungandr/test/optimization/cart_pole_problem_test.py

@@ -62,10 +62,7 @@ def test_cart_pole_problem():
         )
 
     # Minimize sum squared inputs
-    J = 0.0
-    for k in range(N):
-        J += U[:, k : k + 1].T @ U[:, k : k + 1]
-    problem.minimize(J)
+    problem.minimize(sum(U[:, k : k + 1].T @ U[:, k : k + 1] for k in range(N)))
 
     assert problem.cost_function_type() == ExpressionType.QUADRATIC
     assert problem.equality_constraint_type() == ExpressionType.NONLINEAR

jormungandr/test/optimization/differential_drive_problem_test.py

@@ -60,10 +60,12 @@ def test_differential_drive_problem():
         )
 
     # Minimize sum squared states and inputs
-    J = 0.0
-    for k in range(N):
-        J += X[:, k : k + 1].T @ X[:, k : k + 1] + U[:, k : k + 1].T @ U[:, k : k + 1]
-    problem.minimize(J)
+    problem.minimize(
+        sum(
+            X[:, k : k + 1].T @ X[:, k : k + 1] + U[:, k : k + 1].T @ U[:, k : k + 1]
+            for k in range(N)
+        )
+    )
 
     assert problem.cost_function_type() == ExpressionType.QUADRATIC
     assert problem.equality_constraint_type() == ExpressionType.NONLINEAR

jormungandr/test/optimization/double_integrator_problem_test.py

@@ -48,10 +48,7 @@ def test_double_integrator_problem():
     problem.subject_to(U <= 1)
 
     # Cost function - minimize position error
-    J = 0.0
-    for k in range(N + 1):
-        J += (r - X[0, k]) ** 2
-    problem.minimize(J)
+    problem.minimize(sum((r - X[0, k]) ** 2 for k in range(N + 1)))
 
     assert problem.cost_function_type() == ExpressionType.QUADRATIC
     assert problem.equality_constraint_type() == ExpressionType.LINEAR

jormungandr/test/optimization/flywheel_problem_test.py

@@ -39,10 +39,9 @@ def test_flywheel_problem():
 
     # Cost function - minimize error
     r = np.array([[10.0]])
-    J = 0.0
-    for k in range(N + 1):
-        J += (r - X[:, k : k + 1]).T @ (r - X[:, k : k + 1])
-    problem.minimize(J)
+    problem.minimize(
+        sum((r - X[:, k : k + 1]).T @ (r - X[:, k : k + 1]) for k in range(N + 1))
+    )
 
     assert problem.cost_function_type() == ExpressionType.QUADRATIC
     assert problem.equality_constraint_type() == ExpressionType.LINEAR

{sleipnirgroup_jormungandr-0.1.1.dev111.dist-info → sleipnirgroup_jormungandr-0.1.1.dev113.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: sleipnirgroup-jormungandr
-Version: 0.1.1.dev111
+Version: 0.1.1.dev113
 Summary: A linearity-exploiting sparse nonlinear constrained optimization problem solver that uses the interior-point method.
 License: Copyright (c) Sleipnir contributors
         

{sleipnirgroup_jormungandr-0.1.1.dev111.dist-info → sleipnirgroup_jormungandr-0.1.1.dev113.dist-info}/RECORD

@@ -25,21 +25,21 @@ jormungandr/cpp/optimization/bind_inequality_constraints.cpp,sha256=T3rWmJ5dEaES
 jormungandr/cpp/optimization/bind_ocp.cpp,sha256=WD_544lDbaVim96Lu4DM0l-wH3XOrbM-Mq6EryldD9w,5455
 jormungandr/cpp/optimization/bind_problem.cpp,sha256=qXrCO3UewEAeVsKEJ6RFKCvLZ28zangmGjDYp1KnBQY,7804
 jormungandr/test/autodiff/gradient_test.py,sha256=h-25Vg6v4gRg87YZN9tCcN77sPKL__0QJNDMx9e6EX8,18761
-jormungandr/test/autodiff/hessian_test.py,sha256=cEQG2dyVXlwKJoXQXuWSGtl3ZX-ymDoAqtBtUw7tpRg,7093
+jormungandr/test/autodiff/hessian_test.py,sha256=JioZitb74H95HW3N6qn3HYutoCDIi4315c7yC1COjmM,7075
 jormungandr/test/autodiff/jacobian_test.py,sha256=DZyGhm5ccdU3QRVpRoAkrvdM8p8iwZrtoViC56Yy3SM,4363
 jormungandr/test/autodiff/variable_matrix_test.py,sha256=803xIN0OZEWTHwnfWam_6JYWGZTkwNTABZ56oIWkUSw,9991
 jormungandr/test/autodiff/variable_test.py,sha256=ullWfOCp5ij5op1EWVuVRXF3KWEs2e51AJrMU5DKrE0,185
-jormungandr/test/optimization/arm_on_elevator_problem_test.py,sha256=v_Ktd70GXE5fF2ua9tbuZJ6maRyuf9lx5PbGRkkfRcw,3235
-jormungandr/test/optimization/cart_pole_ocp_test.py,sha256=-8Yo9rCO5E4KfuPCjVwV8q4xPzTdfamp-4a5DTw26u8,4052
-jormungandr/test/optimization/cart_pole_problem_test.py,sha256=DpJfdTAGzMYAjdBe4ydFwpxw0HI5u79JAXi9nthYY_4,3869
+jormungandr/test/optimization/arm_on_elevator_problem_test.py,sha256=fmloepGJer_k8gXWWr6jXzyGAzm4VW9wlQXU9b6lfl0,3246
+jormungandr/test/optimization/cart_pole_ocp_test.py,sha256=6A67nMDjzdnCDxTmSYEg6VeF7cIZpyW5vtgWVuPXAVM,4025
+jormungandr/test/optimization/cart_pole_problem_test.py,sha256=93VMOtZuFiOZR6vuXrAnHJhDcIhLpLrNFxvmdDrcvLg,3842
 jormungandr/test/optimization/constraints_test.py,sha256=shkCTmvE8XoXaWzZC-9djbILCAVRKl6kGy3EsXmwC3k,6615
 jormungandr/test/optimization/decision_variable_test.py,sha256=nrOCjKFti9_A-ffAq__GeW8s02duXaGc-u7AHiBhoKc,2240
 jormungandr/test/optimization/differential_drive_ocp_test.py,sha256=BmCdYdFDLEGZ1s6IT6qmcNr-Zg9FWsAHzfuZjH-XfqU,4210
-jormungandr/test/optimization/differential_drive_problem_test.py,sha256=UR25B6681_L00q9MOk94PGNou7FDP_YvDkH0uur0rKs,4266
-jormungandr/test/optimization/double_integrator_problem_test.py,sha256=ObUiSHpm1vAvt_k_tnNZNe7ZusJ98rCQOg0-pJgP0i4,3761
+jormungandr/test/optimization/differential_drive_problem_test.py,sha256=e2-vBcxmfKlDNzsBBI512wgkVQLUbLtH4r1Oe2nQDiY,4287
+jormungandr/test/optimization/double_integrator_problem_test.py,sha256=KKSjwyldBZi1WQ4p_HukYAcqu3Y7zBdx7KaRZgpuOgk,3734
 jormungandr/test/optimization/exit_status_test.py,sha256=LSQfvOZxyGhrjdwz8TMPC8FZJp_yRI-7ygoMO_gMq4o,3654
 jormungandr/test/optimization/flywheel_ocp_test.py,sha256=sFMkXjc_dTJvK6SKFQrIUpaNuOJhnPUWkgBuopSdzKw,5156
-jormungandr/test/optimization/flywheel_problem_test.py,sha256=ARzjY3oa9XlrJ73Np0XJsRITcjMfL3j0LumPZC2YAek,3185
+jormungandr/test/optimization/flywheel_problem_test.py,sha256=8kDVPqRzhEp6pk3hignWdfr6uz9NTOd16zHS6SPHrWQ,3172
 jormungandr/test/optimization/linear_problem_test.py,sha256=zV-2Yi3GCnd7JdvH3L8tsAM9_wWofG5Q-peqMbpwSq4,1459
 jormungandr/test/optimization/multistart_test.py,sha256=aKzetp13hRI77P2hUEbzeVhddFULag9Yl1pNHuZ9BjU,1249
 jormungandr/test/optimization/nonlinear_problem_test.py,sha256=RWhUF-UQG4cWu-i2epnpgsAlaszFONePNMWxyL8W15I,5585
@@ -50,8 +50,8 @@ jormungandr/cpp/optimization/ocp/bind_timestep_method.cpp,sha256=r5wxa5hOHZZqF6t
 jormungandr/cpp/optimization/ocp/bind_transcription_method.cpp,sha256=g5b-Y-HIJbDEBG9ocL65pKmpn0SqCrxEjbeuLCzonRk,697
 jormungandr/cpp/optimization/solver/bind_exit_status.cpp,sha256=RdKzfSVJbeDOBxEgbpHu__UM-52HBOBdq0KPVLytQcM,1560
 jormungandr/cpp/optimization/solver/bind_iteration_info.cpp,sha256=u4y-g_SU1wP2U6esgVOeRaCaWeH2wZqM_TuCy5p6dtQ,1147
-sleipnirgroup_jormungandr-0.1.1.dev111.dist-info/LICENSE.txt,sha256=GO2ESyxbSNqb8hIL18kdV__AfVOlBY3CRXgXLxGamp0,1465
-sleipnirgroup_jormungandr-0.1.1.dev111.dist-info/METADATA,sha256=Xd83Glklb9SyNZtYvMR-Mx1biyBK4izXUoVzal25dD0,17757
-sleipnirgroup_jormungandr-0.1.1.dev111.dist-info/WHEEL,sha256=3vW8KaBza7_EISCaZKT6oQi-Hz3NgshKSzIzzegapKE,106
-sleipnirgroup_jormungandr-0.1.1.dev111.dist-info/entry_points.txt,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
-sleipnirgroup_jormungandr-0.1.1.dev111.dist-info/RECORD,,
+sleipnirgroup_jormungandr-0.1.1.dev113.dist-info/LICENSE.txt,sha256=GO2ESyxbSNqb8hIL18kdV__AfVOlBY3CRXgXLxGamp0,1465
+sleipnirgroup_jormungandr-0.1.1.dev113.dist-info/METADATA,sha256=C9QRK4wMRGCOVHhbgNeNa685_ovQnrMANNBHDujia2M,17757
+sleipnirgroup_jormungandr-0.1.1.dev113.dist-info/WHEEL,sha256=3vW8KaBza7_EISCaZKT6oQi-Hz3NgshKSzIzzegapKE,106
+sleipnirgroup_jormungandr-0.1.1.dev113.dist-info/entry_points.txt,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+sleipnirgroup_jormungandr-0.1.1.dev113.dist-info/RECORD,,