sleipnirgroup-jormungandr 0.5.2.dev2__tar.gz → 0.5.2.dev4__tar.gz

{sleipnirgroup_jormungandr-0.5.2.dev2 → sleipnirgroup_jormungandr-0.5.2.dev4}/PKG-INFO

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

{sleipnirgroup_jormungandr-0.5.2.dev2 → sleipnirgroup_jormungandr-0.5.2.dev4}/include/sleipnir/optimization/solver/exit_status.hpp

@@ -24,20 +24,23 @@ enum class ExitStatus : int8_t {
   GLOBALLY_INFEASIBLE = -3,
   /// The linear system factorization failed.
   FACTORIZATION_FAILED = -4,
+  /// The backtracking line search failed, and the problem isn't locally
+  /// infeasible.
+  LINE_SEARCH_FAILED = -5,
   /// The solver failed to reach the desired tolerance, and feasibility
   /// restoration failed to converge.
-  FEASIBILITY_RESTORATION_FAILED = -5,
+  FEASIBILITY_RESTORATION_FAILED = -6,
   /// The solver encountered nonfinite initial cost, constraints, or derivatives
   /// and gave up.
-  NONFINITE_INITIAL_GUESS = -6,
+  NONFINITE_INITIAL_GUESS = -7,
   /// The solver encountered diverging primal iterates xₖ and/or sₖ and gave up.
-  DIVERGING_ITERATES = -7,
+  DIVERGING_ITERATES = -8,
   /// The solver returned its solution so far after exceeding the maximum number
   /// of iterations.
-  MAX_ITERATIONS_EXCEEDED = -8,
+  MAX_ITERATIONS_EXCEEDED = -9,
   /// The solver returned its solution so far after exceeding the maximum
   /// elapsed wall clock time.
-  TIMEOUT = -9,
+  TIMEOUT = -10,
 };
 
 }  // namespace slp
@@ -76,11 +79,12 @@ struct std::formatter<slp::ExitStatus> {
         return m_underlying.format("globally infeasible", ctx);
       case FACTORIZATION_FAILED:
         return m_underlying.format("factorization failed", ctx);
+      case LINE_SEARCH_FAILED:
+        return m_underlying.format("line search failed", ctx);
       case FEASIBILITY_RESTORATION_FAILED:
         return m_underlying.format("feasibility restoration failed", ctx);
       case NONFINITE_INITIAL_GUESS:
-        return m_underlying.format(
-            "nonfinite initial cost, constraints, or derivatives", ctx);
+        return m_underlying.format("nonfinite initial guess", ctx);
       case DIVERGING_ITERATES:
         return m_underlying.format("diverging iterates", ctx);
       case MAX_ITERATIONS_EXCEEDED:

{sleipnirgroup_jormungandr-0.5.2.dev2 → sleipnirgroup_jormungandr-0.5.2.dev4}/include/sleipnir/optimization/solver/newton.hpp

@@ -204,7 +204,7 @@ ExitStatus newton(
         α *= α_reduction_factor;
 
         if (α < α_min) {
-          return ExitStatus::LOCALLY_INFEASIBLE;
+          return ExitStatus::LINE_SEARCH_FAILED;
         }
         continue;
       }
@@ -236,7 +236,7 @@ ExitStatus newton(
           break;
         }
 
-        return ExitStatus::LOCALLY_INFEASIBLE;
+        return ExitStatus::LINE_SEARCH_FAILED;
       }
     }
 

{sleipnirgroup_jormungandr-0.5.2.dev2 → sleipnirgroup_jormungandr-0.5.2.dev4}/python/cpp/docstrings.hpp

@@ -152,6 +152,10 @@ static const char *__doc_slp_ExitStatus_GLOBALLY_INFEASIBLE =
 R"doc(The problem setup frontend determined the problem to have an empty
 feasible region.)doc";
 
+static const char *__doc_slp_ExitStatus_LINE_SEARCH_FAILED =
+R"doc(The backtracking line search failed, and the problem isn't locally
+infeasible.)doc";
+
 static const char *__doc_slp_ExitStatus_LOCALLY_INFEASIBLE =
 R"doc(The solver determined the problem to be locally infeasible and gave
 up.)doc";

{sleipnirgroup_jormungandr-0.5.2.dev2 → sleipnirgroup_jormungandr-0.5.2.dev4}/python/cpp/optimization/bind_problem.cpp

@@ -112,7 +112,7 @@ void bind_problem(nb::class_<Problem<double>>& cls) {
       //
       // C++'s Problem<double>::solve() takes an Options object instead of
       // keyword arguments, so pybind11_mkdoc generates the wrong docs.
-      R"doc(Solve the optimization problem. The solution will be stored in the
+      R"doc(Solves the optimization problem. The solution will be stored in the
 original variables used to construct the problem.
 
 Parameter ``tolerance``:

{sleipnirgroup_jormungandr-0.5.2.dev2 → sleipnirgroup_jormungandr-0.5.2.dev4}/python/cpp/optimization/solver/bind_exit_status.cpp

@@ -22,6 +22,8 @@ void bind_exit_status(nb::enum_<ExitStatus>& e) {
           DOC(slp, ExitStatus, GLOBALLY_INFEASIBLE));
   e.value("FACTORIZATION_FAILED", ExitStatus::FACTORIZATION_FAILED,
           DOC(slp, ExitStatus, FACTORIZATION_FAILED));
+  e.value("LINE_SEARCH_FAILED", ExitStatus::LINE_SEARCH_FAILED,
+          DOC(slp, ExitStatus, LINE_SEARCH_FAILED));
   e.value("FEASIBILITY_RESTORATION_FAILED",
           ExitStatus::FEASIBILITY_RESTORATION_FAILED,
           DOC(slp, ExitStatus, FEASIBILITY_RESTORATION_FAILED));

{sleipnirgroup_jormungandr-0.5.2.dev2 → sleipnirgroup_jormungandr-0.5.2.dev4}/python/src/sleipnir/__init__.py

@@ -2,4 +2,4 @@
 
 from ._sleipnir import *
 
-__version__ = "0.5.2.dev2"
+__version__ = "0.5.2.dev4"