sleipnirgroup-jormungandr 0.6.6.dev28__tar.gz → 0.6.6.dev30__tar.gz

{sleipnirgroup_jormungandr-0.6.6.dev28 → sleipnirgroup_jormungandr-0.6.6.dev30}/PKG-INFO

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

{sleipnirgroup_jormungandr-0.6.6.dev28 → sleipnirgroup_jormungandr-0.6.6.dev30}/include/sleipnir/optimization/solver/interior_point.hpp

@@ -493,7 +493,7 @@ ExitStatus interior_point(
         // If the inequality constraints are all feasible, prevent them from
         // becoming infeasible again.
         //
-        // See equation (19.30) in [1].
+        // See equation (19.30) of [1].
         trial_s = trial_c_i;
       } else {
         trial_s = s + α * step.p_s;

{sleipnirgroup_jormungandr-0.6.6.dev28 → sleipnirgroup_jormungandr-0.6.6.dev30}/include/sleipnir/optimization/solver/util/bounds.hpp

@@ -215,7 +215,7 @@ void project_onto_bounds(
     // We assume that bound infeasibility is handled elsewhere.
     slp_assert(lower <= upper);
 
-    // See B.2 in [4] and section 3.6 in [2]
+    // See appendix B.2 of [4] and section 3.6 of [2]
     if (isfinite(lower) && isfinite(upper)) {
       auto p_L = std::min(κ_1 * std::max(Scalar(1), abs(lower)),
                           κ_2 * (upper - lower));

{sleipnirgroup_jormungandr-0.6.6.dev28 → sleipnirgroup_jormungandr-0.6.6.dev30}/include/sleipnir/optimization/solver/util/problem_scaling.hpp

@@ -53,7 +53,7 @@ struct ProblemScaling {
   ///
   ///   d_f = min(1, gₘₐₓ / ‖∇f(x₀)‖_∞)
   ///
-  /// See §3.8 Automatic Scaling of the Problem Statement in [2].
+  /// See section 3.8 of [2].
   ///
   /// @param g Cost gradient ∇f, evaluated at the starting point.
   explicit ProblemScaling(const DenseVector& g) {
@@ -70,7 +70,7 @@ struct ProblemScaling {
   ///   d_f     = min(1, gₘₐₓ / ‖∇f(x₀)‖_∞)
   ///   d_cₑ[j] = min(1, gₘₐₓ / ‖∇cₑⱼ(x₀)‖_∞)
   ///
-  /// See §3.8 Automatic Scaling of the Problem Statement in [2].
+  /// See section 3.8 of [2].
   ///
   /// @param g Cost gradient ∇f, evaluated at the starting point.
   /// @param A_e Equality constraint Jacobian Aₑ, evaluated at the starting
@@ -90,7 +90,7 @@ struct ProblemScaling {
   ///   d_f    = min(1, gₘₐₓ / ‖∇f(x₀)‖_∞)
   ///   d_c[j] = min(1, gₘₐₓ / ‖∇cⱼ(x₀)‖_∞)
   ///
-  /// See §3.8 Automatic Scaling of the Problem Statement in [2].
+  /// See section 3.8 of [2].
   ///
   /// @param g Cost gradient ∇f, evaluated at the starting point.
   /// @param A_e Equality constraint Jacobian Aₑ, evaluated at the starting

{sleipnirgroup_jormungandr-0.6.6.dev28 → sleipnirgroup_jormungandr-0.6.6.dev30}/python/src/sleipnir/__init__.py

@@ -2,4 +2,4 @@
 
 from ._sleipnir import *
 
-__version__ = "0.6.6.dev28"
+__version__ = "0.6.6.dev30"