sleipnirgroup-jormungandr 0.0.1.dev469__tar.gz → 0.0.1.dev471__tar.gz

{sleipnirgroup_jormungandr-0.0.1.dev469 → sleipnirgroup_jormungandr-0.0.1.dev471}/PKG-INFO

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

{sleipnirgroup_jormungandr-0.0.1.dev469 → sleipnirgroup_jormungandr-0.0.1.dev471}/pyproject.toml

@@ -1,7 +1,7 @@
 [project]
 name = "sleipnirgroup-jormungandr"
 description = "A linearity-exploiting sparse nonlinear constrained optimization problem solver that uses the interior-point method."
-version = "0.0.1.dev469"
+version = "0.0.1.dev471"
 readme = "README.md"
 requires-python = ">=3.9"
 dependencies = [ "matplotlib", "numpy", "scipy" ]

{sleipnirgroup_jormungandr-0.0.1.dev469 → sleipnirgroup_jormungandr-0.0.1.dev471}/src/optimization/solver/interior_point.cpp

@@ -149,7 +149,7 @@ ExitStatus interior_point(
   // Check for overconstrained problem
   if (num_equality_constraints > num_decision_variables) {
     if (options.diagnostics) {
-      print_too_many_dofs_error(c_e);
+      print_too_few_dofs_error(c_e);
     }
 
     return ExitStatus::TOO_FEW_DOFS;

{sleipnirgroup_jormungandr-0.0.1.dev469 → sleipnirgroup_jormungandr-0.0.1.dev471}/src/optimization/solver/sqp.cpp

@@ -126,7 +126,7 @@ ExitStatus sqp(const SQPMatrixCallbacks& matrix_callbacks,
   // Check for overconstrained problem
   if (num_equality_constraints > num_decision_variables) {
     if (options.diagnostics) {
-      print_too_many_dofs_error(c_e);
+      print_too_few_dofs_error(c_e);
     }
 
     return ExitStatus::TOO_FEW_DOFS;

{sleipnirgroup_jormungandr-0.0.1.dev469 → sleipnirgroup_jormungandr-0.0.1.dev471}/src/util/print_diagnostics.hpp

@@ -87,12 +87,12 @@ inline std::string power_of_10(double value) {
 
 #ifndef SLEIPNIR_DISABLE_DIAGNOSTICS
 /**
- * Prints error for too many degrees of freedom.
+ * Prints error for too few degrees of freedom.
  *
  * @param c_e The problem's equality constraints cₑ(x) evaluated at the current
  *   iterate.
  */
-inline void print_too_many_dofs_error(const Eigen::VectorXd& c_e) {
+inline void print_too_few_dofs_error(const Eigen::VectorXd& c_e) {
   slp::println("The problem has too few degrees of freedom.");
   slp::println("Violated constraints (cₑ(x) = 0) in order of declaration:");
   for (int row = 0; row < c_e.rows(); ++row) {
@@ -102,7 +102,7 @@ inline void print_too_many_dofs_error(const Eigen::VectorXd& c_e) {
   }
 }
 #else
-#define print_too_many_dofs_error(...)
+#define print_too_few_dofs_error(...)
 #endif
 
 #ifndef SLEIPNIR_DISABLE_DIAGNOSTICS
@@ -136,7 +136,7 @@ inline void print_c_e_local_infeasibility_error(const Eigen::VectorXd& c_e) {
  */
 inline void print_c_i_local_infeasibility_error(const Eigen::VectorXd& c_i) {
   slp::println(
-      "The problem is infeasible due to violated inequality "
+      "The problem is locally infeasible due to violated inequality "
       "constraints.");
   slp::println("Violated constraints (cᵢ(x) ≥ 0) in order of declaration:");
   for (int row = 0; row < c_i.rows(); ++row) {