gamspy-pathnlp 52.3.0__py3-none-manylinux_2_28_aarch64.whl

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.
@@ -0,0 +1,9 @@
1
+ import os
2
+ from pathlib import Path
3
+ from .version import __version__
4
+ directory = str(Path(__file__).resolve().parent)
5
+
6
+ files = ['optpathnlp.def', 'gmsptnus.run', 'gmsptnux.out']
7
+
8
+ file_paths = [directory + os.sep + file for file in files]
9
+ verbatim = 'PATHNLP 11 5 PT 1 0 1 LP RMIP NLP DNLP RMINLP QCP RMIQCP\ngmsptnus.run\ngmsptnux.out'
@@ -0,0 +1,4 @@
1
+ #!/bin/sh
2
+ "${5}gmsptnux.out" "$4"
3
+ [ $? = 0 ] || echo "ERROR: Solver exitcode nonzero: $?" 1>&2
4
+ exit 11
Binary file
@@ -0,0 +1,238 @@
1
+ *
2
+ * optpathnlp.def
3
+ *
4
+ path lookup
5
+ output boolean 0 1 1 3 turns all output off or on
6
+ output_model_statistics boolean 0 0 0 3 *** hidden
7
+ cumulative_iteration_limit integer 0 10000 0 maxint 1 1 maximum minor iterations allowed
8
+ adaptive_delta_break double 0 0 mindouble maxdouble 0 1 *** hidden
9
+ adaptive_delta_current double 0 0 mindouble maxdouble 0 1 *** hidden
10
+ adaptive_delta_high double 0 0 mindouble maxdouble 0 1 *** hidden
11
+ adaptive_delta_low double 0 0 mindouble maxdouble 0 1 *** hidden
12
+ adaptive_iteration integer 0 0 minint maxint 0 1 *** hidden
13
+ adaptive_iterations_high integer 0 0 minint maxint 0 1 *** hidden
14
+ adaptive_iterations_low integer 0 0 minint maxint 0 1 *** hidden
15
+ adaptive_pivot_tolerance double 0 0 mindouble maxdouble 0 1 *** hidden
16
+ adaptive_tau_high double 0 0 mindouble maxdouble 0 1 *** hidden
17
+ adaptive_tau_low double 0 0 mindouble maxdouble 0 1 *** hidden
18
+ allow_reform boolean 1 1 1 2 substitute out objective var and equ when possible
19
+ check_skew_symmetry boolean 0 0 0 1 *** hidden
20
+ chen_lambda double 0 0.8 0 1 1 1 lambda parameter for Chen-Chen-Kanzow residual
21
+ convergence_tolerance double 0 1e-6 0 maxdouble 1 1 stopping criterion
22
+ crash_convergence_tolerance double 0 0 mindouble maxdouble 0 1 *** hidden
23
+ crash_iteration_limit integer 0 50 0 maxint 1 1 maximum iterations allowed in basis crash
24
+ crash_merit_function enumstr 0 "fischer" 1 1 merit function used in crash method
25
+ "normal" 1 Use the normal map
26
+ "fischer" 1 Use the Fischer function
27
+ crash_method enumstr 0 "pnewton" 1 1 pnewton or none
28
+ "pnewton" 1 Use projected Newton method
29
+ "none" 1
30
+ crash_minimum_dimension integer 0 1 0 maxint 1 1 minimum problem dimension to perform crash
31
+ crash_minor_iteration_limit integer 0 0 minint maxint 0 1 *** hidden
32
+ crash_nbchange_limit integer 0 1 0 maxint 1 1 limit on crash iterations without basis change
33
+ crash_perturb boolean 0 1 1 1 perturb the problem using pnewton crash
34
+ crash_proximal_increase_factor double 0 0 mindouble maxdouble 0 1 *** hidden
35
+ crash_proximal_initial_maximum double 0 0 mindouble maxdouble 0 1 *** hidden
36
+ crash_proximal_maximum double 0 0 mindouble maxdouble 0 1 *** hidden
37
+ crash_proximal_merit_factor double 0 0 mindouble maxdouble 0 1 *** hidden
38
+ crash_proximal_minimum double 0 0 mindouble maxdouble 0 1 *** hidden
39
+ crash_proximal_shrink_factor double 0 0 mindouble maxdouble 0 1 *** hidden
40
+ crash_refine_frequency integer 0 0 minint maxint 0 1 *** hidden
41
+ crash_searchtype enumstr 0 "line" 1 1 search type to use in the crash method
42
+ "line" 1 Use a linesearch
43
+ "arc" 1 Use an arcsearch
44
+ crash_shrink_factor double 0 0 mindouble maxdouble 0 1 *** hidden
45
+ crash_sigma double 0 0 mindouble maxdouble 0 1 *** hidden
46
+ crash_stepsize_minimum double 0 0 mindouble maxdouble 0 1 *** hidden
47
+ decomposition_size_limit double 0 0 mindouble maxdouble 0 1 *** hidden
48
+ detect_sign_flip boolean 0 0 0 1 *** hidden
49
+ devex_delta double 0 0 mindouble maxdouble 0 1 *** hidden
50
+ devex_pivot_tolerance double 0 0 mindouble maxdouble 0 1 *** hidden
51
+ expand_delta double 0 0 mindouble maxdouble 0 1 *** hidden
52
+ expand_delta_current double 0 0 mindouble maxdouble 0 1 *** hidden
53
+ expand_delta_end double 0 0 mindouble maxdouble 0 1 *** hidden
54
+ expand_delta_start double 0 0 mindouble maxdouble 0 1 *** hidden
55
+ expand_iteration integer 0 0 minint maxint 0 1 *** hidden
56
+ expand_maximum_iterations integer 0 0 minint maxint 0 1 *** hidden
57
+ expand_pivot_tolerance double 0 0 mindouble maxdouble 0 1 *** hidden
58
+ expand_tau double 0 0 mindouble maxdouble 0 1 *** hidden
59
+ factorization_elbowroom double 0 0 mindouble maxdouble 0 1 *** hidden
60
+ factorization_library_name string 0 "" 1 1 name of factorization library
61
+ factorization_luroom double 0 0 mindouble maxdouble 0 1 *** hidden
62
+ factorization_method enumstr 0 "lusol" 1 1 basis package to use
63
+ "lusol" 1
64
+ "blu_lusol" 1
65
+ "umfpack" 1
66
+ "umfpack64" 1
67
+ "highs" 1
68
+ "conopt" 1
69
+ factorization_pivot_tolerance double 0 0 mindouble maxdouble 0 1 *** hidden
70
+ factorization_pivot_type integer 0 0 minint maxint 0 1 *** hidden
71
+ factorization_small_tolerance double 0 0 mindouble maxdouble 0 1 *** hidden
72
+ factorization_tolerance double 0 0 mindouble maxdouble 0 1 *** hidden
73
+ factorization_update_limit integer 0 0 minint maxint 0 1 *** hidden
74
+ factorization_update_ratio double 0 0 mindouble maxdouble 0 1 *** hidden
75
+ factorization_update_tolerance double 0 0 mindouble maxdouble 0 1 *** hidden
76
+ factorization_vectorroom double 0 0 mindouble maxdouble 0 1 *** hidden
77
+ factorization_zero_tolerance double 0 0 mindouble maxdouble 0 1 *** hidden
78
+ gmo_hess_factor double 1 0 0 maxdouble 1 2 maximum multiples of Jacobian size to allow Hessian storage: 0=no limit
79
+ gmres_update_frequency integer 0 0 minint maxint 0 1 *** hidden
80
+ gradient_refine_frequency integer 0 0 minint maxint 0 1 *** hidden
81
+ gradient_searchtype enumstr 0 "arc" 1 1 search type to use on a gradient step
82
+ "line" 1 Use a linesearch
83
+ "arc" 1 Use an arcsearch
84
+ gradient_shrink_factor double 0 0 mindouble maxdouble 0 1 *** hidden
85
+ gradient_sigma double 0 0 mindouble maxdouble 0 1 *** hidden
86
+ gradient_step_limit integer 0 5 0 maxint 1 1 gradient steps allowed before restarting
87
+ gradient_stepsize_minimum double 0 0 mindouble maxdouble 0 1 *** hidden
88
+ ilu_drop_tolerance double 0 0 mindouble maxdouble 0 1 *** hidden
89
+ ilu_perturbation double 0 0 mindouble maxdouble 0 1 *** hidden
90
+ ilu_perturbation_decrease_factor double 0 0 mindouble maxdouble 0 1 *** hidden
91
+ ilu_perturbation_increase_factor double 0 0 mindouble maxdouble 0 1 *** hidden
92
+ ilu_perturbation_initial_value double 0 0 mindouble maxdouble 0 1 *** hidden
93
+ ilu_perturbation_small_value double 0 0 mindouble maxdouble 0 1 *** hidden
94
+ infinity double 0 0 mindouble maxdouble 0 1 *** hidden
95
+ interrupt_limit integer 0 5 1 maxint 1 1 ctrl-C's required before a hard kill of the solver
96
+ jacobian_smoothing double 0 0 mindouble maxdouble 0 1 *** hidden
97
+ lemke_artificial_maximum double 0 0 mindouble maxdouble 0 1 *** hidden
98
+ lemke_artificial_minimum double 0 0 mindouble maxdouble 0 1 *** hidden
99
+ lemke_cycle_limit integer 0 0 minint maxint 0 1 *** hidden
100
+ lemke_maximum_iteration_limit integer 0 0 minint maxint 0 1 *** hidden
101
+ lemke_pivot_type enumstr 0 "expand" 0 1 *** hidden
102
+ "textbook" 1
103
+ "devex" 1
104
+ "expand" 1
105
+ "adaptive" 1
106
+ lemke_rank_deficiency_iterations integer 0 10 0 maxint 1 1 number of attempts made to fix rank-deficient basis during Lemke start
107
+ lemke_rayterm_minimum double 0 0 mindouble maxdouble 0 1 *** hidden
108
+ lemke_return_best_point boolean 0 0 0 1 *** hidden
109
+ lemke_scale_residual boolean 0 0 0 1 *** hidden
110
+ lemke_size_factor double 0 0 mindouble maxdouble 0 1 *** hidden
111
+ lemke_start enumstr 0 "automatic" 1 1 frequency of lemke starts
112
+ "always" 1 Use a Lemke start for each LCP subproblem
113
+ "automatic" 1 Determined by algorithm
114
+ "first" 1 Use a Lemke start for the first LCP subproblem
115
+ lemke_start_tolerance double 0 0 mindouble maxdouble 0 1 *** hidden
116
+ lemke_start_type enumstr 0 "slack" 1 1 type of lemke start
117
+ "advanced" 1 Start Lemke method using an advanced basis
118
+ "slack" 1 Start Lemke method using an all-slack basis
119
+ linear_model_perturb boolean 0 0 0 1 *** hidden
120
+ linear_model_presolve boolean 0 0 0 1 *** hidden
121
+ linear_model_scale boolean 0 0 0 1 *** hidden
122
+ linear_scale_method enumstr 0 "diagonal" 0 1 *** hidden
123
+ "Todd" 1
124
+ "Chen" 1
125
+ "diagonal" 1
126
+ "row" 1
127
+ "col" 1
128
+ "both" 1
129
+ "symmetric" 1
130
+ "ro1" 1
131
+ "ro2" 1
132
+ "ro3" 1
133
+ "ro4" 1
134
+ major_iteration_limit integer 0 500 0 maxint 1 1 maximum major iterations allowed
135
+ merit_function enumstr 0 "fischer" 1 1 merit function to use (normal or fischer)
136
+ "normal" 1 Use the normal map
137
+ "fischer" 1 Use the Fischer function
138
+ minor_iteration_limit integer 0 1000 0 maxint 1 1 minor iterations allowed in each major iteration: default MIN(2n,iterlim)
139
+ nlp_lambda double 1 0 0 maxdouble 1 2 linesearch factor when using the NLP objective
140
+ nlp_objective boolean 1 0 1 2 treat NLP objective differently in PATH linesearch
141
+ nms boolean 0 1 1 1 allow line searching, watch-dogging, and nonmonotone descent
142
+ nms_delta_min double 0 0 mindouble maxdouble 0 1 *** hidden
143
+ nms_delta_shrink_factor double 0 0 mindouble maxdouble 0 1 *** hidden
144
+ nms_initial_monotone_steps integer 0 0 minint maxint 0 1 *** hidden
145
+ nms_initial_reference_factor double 0 20 0 maxdouble 1 1 controls size of initial reference value
146
+ nms_initial_reference_minimum double 0 0 mindouble maxdouble 0 1 *** hidden
147
+ nms_initial_stepsize_factor double 0 0 mindouble maxdouble 0 1 *** hidden
148
+ nms_initial_stepsize_minimum double 0 0 mindouble maxdouble 0 1 *** hidden
149
+ nms_large_reference_factor double 0 0 mindouble maxdouble 0 1 *** hidden
150
+ nms_maximum_watchdogs integer 0 5 0 maxint 1 1 maximum number of watchdog steps allowed
151
+ nms_memory_size integer 0 10 0 maxint 1 1 number of reference values kept
152
+ nms_mstep_frequency integer 0 10 0 maxint 1 1 frequency at which m-steps are performed
153
+ nms_pathsearch_interpolate boolean 0 0 0 1 *** hidden
154
+ nms_refine_frequency integer 0 0 minint maxint 0 1 *** hidden
155
+ nms_searchtype enumstr 0 "line" 1 1 search type to use
156
+ "line" 1 Use a linesearch
157
+ "arc" 1 Use an arcsearch
158
+ nms_shrink_factor double 0 0 mindouble maxdouble 0 1 *** hidden
159
+ nms_sigma double 0 0 mindouble maxdouble 0 1 *** hidden
160
+ nms_stepsize_minimum double 0 0 mindouble maxdouble 0 1 *** hidden
161
+ nonlinear_model_perturb boolean 0 0 0 1 *** hidden
162
+ nonlinear_model_presolve boolean 0 0 0 1 *** hidden
163
+ nonlinear_model_scale boolean 0 0 0 1 *** hidden
164
+ nonlinear_model_use_start boolean 0 0 0 1 *** hidden
165
+ output_memory boolean 1 0 1 2 output breakdown of where memory is used
166
+ output_crash_iterations boolean 0 1 1 3 output information on crash iterations
167
+ output_crash_iterations_frequency integer 0 1 1 maxint 1 3 frequency at which crash iteration log is printed
168
+ output_errors boolean 0 1 1 3 output error messages
169
+ output_factorization_singularities boolean 0 0 0 3 *** hidden
170
+ output_factorization_updates boolean 0 0 0 3 *** hidden
171
+ output_factorization_updates_frequency integer 0 0 minint maxint 0 3 *** hidden
172
+ output_final_degeneracy_statistics boolean 0 0 1 3 print information regarding degeneracy at the solution
173
+ output_final_point boolean 0 0 1 3 output final point returned from PATH
174
+ output_final_point_statistics boolean 0 1 1 3 output information about the point, function, and Jacobian at the final point
175
+ output_final_scaling_statistics boolean 0 0 1 3 display matrix norms on the Jacobian at the final point
176
+ output_final_statistics boolean 0 1 1 3 output evaluation of available merit functions at the final point
177
+ output_final_summary boolean 0 1 1 3 output summary information
178
+ output_hidden_options boolean 0 0 0 3 *** hidden
179
+ output_initial_point boolean 0 0 1 3 output initial point given to PATH
180
+ output_initial_point_statistics boolean 0 1 1 3 output information about the point, function, and Jacobian at the initial point
181
+ output_initial_scaling_statistics boolean 0 1 1 3 display matrix norms on the Jacobian at the initial point
182
+ output_initial_statistics boolean 0 0 1 3 output evaluation of available merit functions at the initial point
183
+ output_license boolean 0 0 0 3 *** hidden
184
+ output_linear_model boolean 0 0 1 3 output linear model at each major iteration
185
+ output_major_iterations boolean 0 1 1 3 output information on major iterations
186
+ output_major_iterations_frequency integer 0 1 1 maxint 1 3 frequency at which major iteration log is printed
187
+ output_maximum_zero_log integer 0 10 0 maxint 1 3 limits zero columns reported to log file
188
+ output_maximum_zero_listing integer 0 1000 0 maxint 1 3 limits zero columns reported to listing file
189
+ output_minor_iterations boolean 0 1 1 3 output information on minor iterations
190
+ output_minor_iterations_frequency integer 0 500 1 maxint 1 3 frequency at which minor iteration log is printed
191
+ output_nms_iterations boolean 0 0 0 3 *** hidden
192
+ output_nms_iterations_frequency integer 0 0 minint maxint 0 3 *** hidden
193
+ option_direct strlist 1 0 1 pass options directly to PATH library
194
+ option_file string 1 "" 1 1 name of option file for PATHLIB to read
195
+ output_options boolean 0 0 1 3 output all options and their values
196
+ output_preprocess_level integer 0 1 -1 maxint 1 3 control output of preprocessing information
197
+ output_restart_log boolean 0 1 1 3 output options during restarts
198
+ output_time boolean 1 0 1 3 output breakdown of where time is spent
199
+ output_warnings boolean 0 0 1 3 output warning messages
200
+ path_basis_modify_tol double 0 0 mindouble maxdouble 0 1 *** hidden
201
+ path_basis_modify_verbose boolean 0 0 0 1 *** hidden
202
+ preprocess boolean 0 1 1 1 turns preprocessing on/off
203
+ preprocess_implied boolean 0 0 0 1 *** hidden
204
+ preprocess_jacobian_tolerance double 0 0 mindouble maxdouble 0 1 *** hidden
205
+ preprocess_recursive boolean 0 0 0 1 *** hidden
206
+ preprocess_tighten boolean 0 0 0 1 *** hidden
207
+ preprocess_zero_tolerance double 0 0 mindouble maxdouble 0 1 *** hidden
208
+ project_start boolean 0 0 0 1 *** hidden
209
+ proximal_dual boolean 0 0 0 1 *** hidden
210
+ proximal_increase_factor double 0 0 mindouble maxdouble 0 1 *** hidden
211
+ proximal_initial double 0 0 mindouble maxdouble 0 1 *** hidden
212
+ proximal_initial_maximum double 0 0 mindouble maxdouble 0 1 *** hidden
213
+ proximal_merit_factor double 0 0 mindouble maxdouble 0 1 *** hidden
214
+ proximal_minimum double 0 0 mindouble maxdouble 0 1 *** hidden
215
+ proximal_perturbation double 0 0 0 maxdouble 1 1 initial perturbation
216
+ proximal_primal boolean 0 0 0 1 *** hidden
217
+ proximal_shrink_factor double 0 0 mindouble maxdouble 0 1 *** hidden
218
+ recovery_method enumstr 0 "none" 0 1 *** hidden
219
+ "none" 1
220
+ residual_factor double 0 0 mindouble maxdouble 0 1 *** hidden
221
+ residual_size double 0 0 mindouble maxdouble 0 1 *** hidden
222
+ restart_limit integer 0 0 minint maxint 0 1 *** hidden: maximum number of restarts attempted
223
+ restart_stationary_limit integer 0 0 minint maxint 0 1 *** hidden
224
+ restart_stationary_tolerance double 0 0 mindouble maxdouble 0 1 *** hidden
225
+ return_best_point boolean 0 0 0 1 *** hidden: return the best point encountered, not the absolute last iterate
226
+ skip_kkt boolean 1 0 1 2 go right to Phase I / Phase II method
227
+ textbook_delta double 0 0 mindouble maxdouble 0 1 *** hidden
228
+ textbook_pivot_tolerance double 0 0 mindouble maxdouble 0 1 *** hidden
229
+ time_limit double 0 0 0 maxdouble 1 1 number of seconds algorithm is allowed to run
230
+ myeolchar EOLCOMM ;#!
231
+ *
232
+ * Groups
233
+ * <group-ident> group <group-number <help-context> <help-text>
234
+ *
235
+ general group 1 1 General options
236
+ nlp group 2 1 NLP-specific options
237
+ output group 3 1 Output options
238
+ *** End of file
@@ -0,0 +1 @@
1
+ __version__ = '52.3.0'
@@ -0,0 +1,3 @@
1
+ Metadata-Version: 2.4
2
+ Name: gamspy_pathnlp
3
+ Version: 52.3.0
@@ -0,0 +1,9 @@
1
+ gamspy_pathnlp/__init__.py,sha256=JQiaCZffTCRaJc3pv53Mt7E7EMrK1dGcQT001boxcKI,335
2
+ gamspy_pathnlp/gmsptnus.run,sha256=ne7xYKy1cAjzVjj7BosMW9S_la4f1vNmMqJtQbwA5eQ,103
3
+ gamspy_pathnlp/gmsptnux.out,sha256=p_FET7zg142guv84wNpkXaQsB9yHbp98y4lThvVTvz0,330192
4
+ gamspy_pathnlp/optpathnlp.def,sha256=rO1jl2gwoWJFF53HfvqZKXnH_ZcKtpQ-pvxGIXIIZxE,14288
5
+ gamspy_pathnlp/version.py,sha256=IL5pezJmCjGpwq_6ZK51hRFtq6AqiesIp9dklBfT92s,22
6
+ gamspy_pathnlp-52.3.0.dist-info/METADATA,sha256=7ZPM4uVIGx9HW1TS_77U12469dpqvMPBqDJ54LRdVeE,59
7
+ gamspy_pathnlp-52.3.0.dist-info/WHEEL,sha256=t5_TVo5EoIcKNBhWzfot9g64ilMSG_CsDKeV6kLKeBo,116
8
+ gamspy_pathnlp-52.3.0.dist-info/top_level.txt,sha256=vzAsj49jT_HUlLcx3BanPczI2zHuM7Ot2C99l1yAMCc,15
9
+ gamspy_pathnlp-52.3.0.dist-info/RECORD,,
@@ -0,0 +1,5 @@
1
+ Wheel-Version: 1.0
2
+ Generator: setuptools (80.9.0)
3
+ Root-Is-Purelib: false
4
+
5
+ Tag: py3-none-manylinux_2_28_aarch64
@@ -0,0 +1 @@
1
+ gamspy_pathnlp