openscvx 0.4.1.dev149__tar.gz → 0.4.1.dev150__tar.gz

{openscvx-0.4.1.dev149/openscvx.egg-info → openscvx-0.4.1.dev150}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: openscvx
-Version: 0.4.1.dev149
+Version: 0.4.1.dev150
 Summary: A general Python-based successive convexification implementation which uses a JAX backend.
 Author-email: Chris Hayner and Griffin Norris <haynec@uw.edu>
 License: Apache Software License

{openscvx-0.4.1.dev149 → openscvx-0.4.1.dev150}/openscvx/_version.py

@@ -28,7 +28,7 @@ version_tuple: VERSION_TUPLE
 commit_id: COMMIT_ID
 __commit_id__: COMMIT_ID
 
-__version__ = version = '0.4.1.dev149'
-__version_tuple__ = version_tuple = (0, 4, 1, 'dev149')
+__version__ = version = '0.4.1.dev150'
+__version_tuple__ = version_tuple = (0, 4, 1, 'dev150')
 
-__commit_id__ = commit_id = 'g3f2c1a4f1'
+__commit_id__ = commit_id = 'g38b5b531a'

{openscvx-0.4.1.dev149 → openscvx-0.4.1.dev150}/openscvx/problem.py

@@ -293,20 +293,6 @@ class Problem:
                 )
             self._algorithm = algorithm
 
-        # Build per-constraint lam_vb arrays from symbolic constraints and
-        # re-normalize so that per-constraint .weight() overrides participate
-        # in the normalization scale.  Include byof constraint counts so the
-        # arrays are sized to match the post-lowering constraint list.
-        n_byof_nodal = len(byof.get("nodal_constraints", [])) if byof else 0
-        n_byof_cross = len(byof.get("cross_nodal_constraints", [])) if byof else 0
-        self._algorithm._resolve_lam_vb(
-            N=self.symbolic.N,
-            nodal_constraints=self.symbolic.constraints.nodal,
-            cross_node_constraints=self.symbolic.constraints.cross_node,
-            n_byof_nodal=n_byof_nodal,
-            n_byof_cross=n_byof_cross,
-        )
-
         # Resolve discretizer: None → default, dict → LinearizeDiscretize(**dict), instance → use
         if discretizer is None:
             self._discretizer = LinearizeDiscretize()
@@ -850,6 +836,19 @@ class Problem:
             save_compiled=self.settings.sim.save_compiled,
         )
 
+        # Build per-constraint lam_vb arrays from symbolic constraints and
+        # re-normalize. Deferred to initialize() so that user-set lam_vb
+        # values (assigned after Problem construction) are picked up.
+        n_byof_nodal = len(self._byof.get("nodal_constraints", [])) if self._byof else 0
+        n_byof_cross = len(self._byof.get("cross_nodal_constraints", [])) if self._byof else 0
+        self._algorithm._resolve_lam_vb(
+            N=self.symbolic.N,
+            nodal_constraints=self.symbolic.constraints.nodal,
+            cross_node_constraints=self.symbolic.constraints.cross_node,
+            n_byof_nodal=n_byof_nodal,
+            n_byof_cross=n_byof_cross,
+        )
+
         # Initialize the SCP algorithm
         print("Initializing the SCvx Subproblem Solver...")
         self._algorithm.initialize(

{openscvx-0.4.1.dev149 → openscvx-0.4.1.dev150/openscvx.egg-info}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: openscvx
-Version: 0.4.1.dev149
+Version: 0.4.1.dev150
 Summary: A general Python-based successive convexification implementation which uses a JAX backend.
 Author-email: Chris Hayner and Griffin Norris <haynec@uw.edu>
 License: Apache Software License