sip-python 0.0.3__tar.gz → 0.0.5__tar.gz
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- {sip_python-0.0.3 → sip_python-0.0.5}/PKG-INFO +3 -1
- {sip_python-0.0.3 → sip_python-0.0.5}/pyproject.toml +6 -1
- {sip_python-0.0.3 → sip_python-0.0.5}/src/sip_python/helpers.py +7 -6
- {sip_python-0.0.3 → sip_python-0.0.5}/src/sip_python.egg-info/PKG-INFO +3 -1
- sip_python-0.0.5/src/sip_python.egg-info/requires.txt +5 -0
- {sip_python-0.0.3 → sip_python-0.0.5}/tests/test_simple_constrained_lqr.py +10 -11
- {sip_python-0.0.3 → sip_python-0.0.5}/tests/test_simple_lqr.py +9 -10
- {sip_python-0.0.3 → sip_python-0.0.5}/tests/test_simple_nlp.py +7 -8
- {sip_python-0.0.3 → sip_python-0.0.5}/tests/test_simple_qp.py +7 -8
- sip_python-0.0.3/src/sip_python.egg-info/requires.txt +0 -2
- {sip_python-0.0.3 → sip_python-0.0.5}/LICENSE +0 -0
- {sip_python-0.0.3 → sip_python-0.0.5}/README.md +0 -0
- {sip_python-0.0.3 → sip_python-0.0.5}/setup.cfg +0 -0
- {sip_python-0.0.3 → sip_python-0.0.5}/setup.py +0 -0
- {sip_python-0.0.3 → sip_python-0.0.5}/src/sip_python/__init__.py +0 -0
- {sip_python-0.0.3 → sip_python-0.0.5}/src/sip_python.egg-info/SOURCES.txt +0 -0
- {sip_python-0.0.3 → sip_python-0.0.5}/src/sip_python.egg-info/dependency_links.txt +0 -0
- {sip_python-0.0.3 → sip_python-0.0.5}/src/sip_python.egg-info/top_level.txt +0 -0
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
Metadata-Version: 2.4
|
|
2
2
|
Name: sip_python
|
|
3
|
-
Version: 0.0.
|
|
3
|
+
Version: 0.0.5
|
|
4
4
|
Summary: Python bindings for the SIP solver.
|
|
5
5
|
Author-email: João Sousa-Pinto <joaospinto@gmail.com>
|
|
6
6
|
Project-URL: Homepage, https://github.com/joaospinto/sip_python
|
|
@@ -12,6 +12,8 @@ Description-Content-Type: text/markdown
|
|
|
12
12
|
License-File: LICENSE
|
|
13
13
|
Requires-Dist: numpy
|
|
14
14
|
Requires-Dist: scipy
|
|
15
|
+
Provides-Extra: test
|
|
16
|
+
Requires-Dist: pytest; extra == "test"
|
|
15
17
|
Dynamic: license-file
|
|
16
18
|
|
|
17
19
|
# sip_python
|
|
@@ -4,7 +4,7 @@ build-backend = "setuptools.build_meta"
|
|
|
4
4
|
|
|
5
5
|
[project]
|
|
6
6
|
name = "sip_python"
|
|
7
|
-
version = "0.0.
|
|
7
|
+
version = "0.0.5"
|
|
8
8
|
description = "Python bindings for the SIP solver."
|
|
9
9
|
readme = "README.md"
|
|
10
10
|
requires-python = ">=3.10"
|
|
@@ -19,5 +19,10 @@ dependencies = [
|
|
|
19
19
|
"scipy",
|
|
20
20
|
]
|
|
21
21
|
|
|
22
|
+
[project.optional-dependencies]
|
|
23
|
+
test = [
|
|
24
|
+
"pytest",
|
|
25
|
+
]
|
|
26
|
+
|
|
22
27
|
[project.urls]
|
|
23
28
|
Homepage = "https://github.com/joaospinto/sip_python"
|
|
@@ -33,11 +33,10 @@ except Exception:
|
|
|
33
33
|
|
|
34
34
|
def _amd_order(K_csc):
|
|
35
35
|
"""Compute AMD ordering on a CSC matrix via libamd."""
|
|
36
|
-
|
|
37
|
-
|
|
38
|
-
|
|
39
|
-
|
|
40
|
-
Ai = K_sym.indices.astype(np.int64)
|
|
36
|
+
K_csc.sort_indices()
|
|
37
|
+
n = K_csc.shape[0]
|
|
38
|
+
Ap = K_csc.indptr.astype(np.int64)
|
|
39
|
+
Ai = K_csc.indices.astype(np.int64)
|
|
41
40
|
perm = np.empty(n, dtype=np.int64)
|
|
42
41
|
ret = _libamd.amd_l_order(
|
|
43
42
|
n,
|
|
@@ -72,6 +71,7 @@ def get_K(P, A, G):
|
|
|
72
71
|
|
|
73
72
|
mod_P = spa.csc_matrix.copy(P)
|
|
74
73
|
mod_P.data[:] = 1.0
|
|
74
|
+
mod_P = mod_P + mod_P.T
|
|
75
75
|
|
|
76
76
|
Z = spa.csc_matrix((y_dim, s_dim))
|
|
77
77
|
|
|
@@ -114,8 +114,9 @@ def get_kkt_and_L_nnzs(K, perm_inv):
|
|
|
114
114
|
permuted_K.col = perm_inv[permuted_K.col]
|
|
115
115
|
|
|
116
116
|
kkt_L_nnz = getLnnz(spa.triu(permuted_K))
|
|
117
|
+
kkt_nnz = spa.triu(permuted_K).nnz
|
|
117
118
|
|
|
118
|
-
return
|
|
119
|
+
return kkt_nnz, kkt_L_nnz
|
|
119
120
|
|
|
120
121
|
|
|
121
122
|
def get_kkt_perm_inv_and_nnzs(P, A, G, verbose=True):
|
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
Metadata-Version: 2.4
|
|
2
2
|
Name: sip_python
|
|
3
|
-
Version: 0.0.
|
|
3
|
+
Version: 0.0.5
|
|
4
4
|
Summary: Python bindings for the SIP solver.
|
|
5
5
|
Author-email: João Sousa-Pinto <joaospinto@gmail.com>
|
|
6
6
|
Project-URL: Homepage, https://github.com/joaospinto/sip_python
|
|
@@ -12,6 +12,8 @@ Description-Content-Type: text/markdown
|
|
|
12
12
|
License-File: LICENSE
|
|
13
13
|
Requires-Dist: numpy
|
|
14
14
|
Requires-Dist: scipy
|
|
15
|
+
Provides-Extra: test
|
|
16
|
+
Requires-Dist: pytest; extra == "test"
|
|
15
17
|
Dynamic: license-file
|
|
16
18
|
|
|
17
19
|
# sip_python
|
|
@@ -22,18 +22,18 @@ jax.config.update("jax_enable_x64", True)
|
|
|
22
22
|
|
|
23
23
|
def test_simple_constrained_lqr():
|
|
24
24
|
ss = Settings()
|
|
25
|
-
ss.
|
|
26
|
-
ss.
|
|
27
|
-
ss.
|
|
25
|
+
ss.termination.max_dual_residual = 1e-6
|
|
26
|
+
ss.termination.max_constraint_violation = 1e-6
|
|
27
|
+
ss.termination.max_complementarity_gap = 1e-6
|
|
28
28
|
ss.assert_checks_pass = True
|
|
29
|
-
ss.penalty_parameter_increase_factor = 2.0
|
|
30
|
-
ss.mu_update_factor = 0.9
|
|
29
|
+
ss.penalty.penalty_parameter_increase_factor = 2.0
|
|
30
|
+
ss.barrier.mu_update_factor = 0.9
|
|
31
31
|
ss.max_iterations = 200
|
|
32
|
-
ss.
|
|
33
|
-
ss.print_logs = False
|
|
34
|
-
ss.print_line_search_logs = False
|
|
35
|
-
ss.print_search_direction_logs = False
|
|
36
|
-
ss.print_derivative_check_logs = False
|
|
32
|
+
ss.line_search.max_iterations = 1000
|
|
33
|
+
ss.logging.print_logs = False
|
|
34
|
+
ss.logging.print_line_search_logs = False
|
|
35
|
+
ss.logging.print_search_direction_logs = False
|
|
36
|
+
ss.logging.print_derivative_check_logs = False
|
|
37
37
|
|
|
38
38
|
x_dim = 2
|
|
39
39
|
u_dim = 1
|
|
@@ -187,7 +187,6 @@ def test_simple_constrained_lqr():
|
|
|
187
187
|
vars.x[:] = 0.0
|
|
188
188
|
vars.s[:] = 1.0
|
|
189
189
|
vars.y[:] = 0.0
|
|
190
|
-
vars.e[:] = 0.0
|
|
191
190
|
vars.z[:] = 1.0
|
|
192
191
|
|
|
193
192
|
output = solver.solve(vars)
|
|
@@ -22,16 +22,16 @@ jax.config.update("jax_enable_x64", True)
|
|
|
22
22
|
|
|
23
23
|
def test_simple_lqr():
|
|
24
24
|
ss = Settings()
|
|
25
|
-
ss.
|
|
26
|
-
ss.
|
|
27
|
-
ss.
|
|
25
|
+
ss.termination.max_dual_residual = 1e-6
|
|
26
|
+
ss.termination.max_constraint_violation = 1e-6
|
|
27
|
+
ss.termination.max_complementarity_gap = 1e-6
|
|
28
28
|
ss.assert_checks_pass = True
|
|
29
|
-
ss.penalty_parameter_increase_factor = 2.0
|
|
30
|
-
ss.mu_update_factor = 0.9
|
|
31
|
-
ss.print_logs = False
|
|
32
|
-
ss.print_line_search_logs = False
|
|
33
|
-
ss.print_search_direction_logs = False
|
|
34
|
-
ss.print_derivative_check_logs = False
|
|
29
|
+
ss.penalty.penalty_parameter_increase_factor = 2.0
|
|
30
|
+
ss.barrier.mu_update_factor = 0.9
|
|
31
|
+
ss.logging.print_logs = False
|
|
32
|
+
ss.logging.print_line_search_logs = False
|
|
33
|
+
ss.logging.print_search_direction_logs = False
|
|
34
|
+
ss.logging.print_derivative_check_logs = False
|
|
35
35
|
|
|
36
36
|
x_dim = 2
|
|
37
37
|
u_dim = 1
|
|
@@ -163,7 +163,6 @@ def test_simple_lqr():
|
|
|
163
163
|
vars.x[:] = 0.0
|
|
164
164
|
vars.s[:] = 1.0
|
|
165
165
|
vars.y[:] = 0.0
|
|
166
|
-
vars.e[:] = 0.0
|
|
167
166
|
vars.z[:] = 1.0
|
|
168
167
|
|
|
169
168
|
output = solver.solve(vars)
|
|
@@ -22,14 +22,14 @@ jax.config.update("jax_enable_x64", True)
|
|
|
22
22
|
|
|
23
23
|
def test_simple_qp():
|
|
24
24
|
ss = Settings()
|
|
25
|
-
ss.
|
|
26
|
-
ss.
|
|
27
|
-
ss.
|
|
25
|
+
ss.termination.max_dual_residual = 1e-6
|
|
26
|
+
ss.termination.max_constraint_violation = 1e-6
|
|
27
|
+
ss.termination.max_complementarity_gap = 1e-6
|
|
28
28
|
ss.assert_checks_pass = True
|
|
29
|
-
ss.print_logs = False
|
|
30
|
-
ss.print_line_search_logs = False
|
|
31
|
-
ss.print_search_direction_logs = False
|
|
32
|
-
ss.print_derivative_check_logs = False
|
|
29
|
+
ss.logging.print_logs = False
|
|
30
|
+
ss.logging.print_line_search_logs = False
|
|
31
|
+
ss.logging.print_search_direction_logs = False
|
|
32
|
+
ss.logging.print_derivative_check_logs = False
|
|
33
33
|
|
|
34
34
|
@jax.jit
|
|
35
35
|
def f(x):
|
|
@@ -133,7 +133,6 @@ def test_simple_qp():
|
|
|
133
133
|
vars.x[:] = 0.0
|
|
134
134
|
vars.s[:] = 1.0
|
|
135
135
|
vars.y[:] = 0.0
|
|
136
|
-
vars.e[:] = 0.0
|
|
137
136
|
vars.z[:] = 1.0
|
|
138
137
|
|
|
139
138
|
output = solver.solve(vars)
|
|
@@ -22,14 +22,14 @@ jax.config.update("jax_enable_x64", True)
|
|
|
22
22
|
|
|
23
23
|
def test_simple_qp():
|
|
24
24
|
ss = Settings()
|
|
25
|
-
ss.
|
|
26
|
-
ss.
|
|
27
|
-
ss.
|
|
25
|
+
ss.termination.max_dual_residual = 1e-6
|
|
26
|
+
ss.termination.max_constraint_violation = 1e-6
|
|
27
|
+
ss.termination.max_complementarity_gap = 1e-6
|
|
28
28
|
ss.assert_checks_pass = True
|
|
29
|
-
ss.print_logs = False
|
|
30
|
-
ss.print_line_search_logs = False
|
|
31
|
-
ss.print_search_direction_logs = False
|
|
32
|
-
ss.print_derivative_check_logs = False
|
|
29
|
+
ss.logging.print_logs = False
|
|
30
|
+
ss.logging.print_line_search_logs = False
|
|
31
|
+
ss.logging.print_search_direction_logs = False
|
|
32
|
+
ss.logging.print_derivative_check_logs = False
|
|
33
33
|
|
|
34
34
|
@jax.jit
|
|
35
35
|
def f(x):
|
|
@@ -132,7 +132,6 @@ def test_simple_qp():
|
|
|
132
132
|
vars.x[:] = 0.0
|
|
133
133
|
vars.s[:] = 1.0
|
|
134
134
|
vars.y[:] = 0.0
|
|
135
|
-
vars.e[:] = 0.0
|
|
136
135
|
vars.z[:] = 1.0
|
|
137
136
|
|
|
138
137
|
output = solver.solve(vars)
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|