The MOSEK Python optimizer API manual Version 7.0 (Revision 141)
Optimizer API for Python - Documentation - Mosek Optimizer API for Python - Documentation - Mosek
248 APPENDIX A. API REFERENCE A.2.83 Task.getmemusage() meminuse,maxmemuse = Task.getmemusage() Obtains information about the amount of memory used by a task. Arguments maxmemuse : long Maximum amount of memory used by the task until now. meminuse : long Amount of memory currently used by the task. Description: Obtains information about the amount of memory used by a task. A.2.84 Task.getnumanz() numanz = Task.getnumanz() Obtains the number of non-zeros in the coefficient matrix. Arguments numanz : int Number of non-zero elements in the linear constraint matrix. Description: Obtains the number of non-zeros in A. A.2.85 Task.getnumanz64() numanz = Task.getnumanz64() Obtains the number of non-zeros in the coefficient matrix. Arguments numanz : long Number of non-zero elements in the linear constraint matrix. Description: Obtains the number of non-zeros in A.
A.2. CLASS TASK 249 A.2.86 Task.getnumbarablocktriplets() num = Task.getnumbarablocktriplets() Obtains an upper bound on the number of scalar elements in the block triplet form of bara. Arguments num : long Number elements in the block triplet form of Ā. Description: Obtains an upper bound on the number of elements in the block triplet form of Ā. A.2.87 Task.getnumbaranz() nz = Task.getnumbaranz() Get the number of nonzero elements in barA. Arguments nz : long The number of nonzero elements in Ā i.e. the number of ā ij elements that is nonzero. Description: Get the number of nonzero elements in Ā. A.2.88 Task.getnumbarcblocktriplets() num = Task.getnumbarcblocktriplets() Obtains an upper bound on the number of elements in the block triplet form of barc. Arguments num : long An upper bound on the number elements in the block trip let form of ¯c. Description: Obtains an upper bound on the number of elements in the block triplet form of ¯C.
- Page 219 and 220: 15.6. SENSITIVITY ANALYSIS WITH THE
- Page 221 and 222: Appendix A API reference This chapt
- Page 223 and 224: 201 • Task.relaxprimal Obtain inf
- Page 225 and 226: A.1. EXCEPTIONS 203 • Task.putvar
- Page 227 and 228: A.2. CLASS TASK 205 Arguments which
- Page 229 and 230: A.2. CLASS TASK 207 See also • Ro
- Page 231 and 232: A.2. CLASS TASK 209 Description: Ap
- Page 233 and 234: A.2. CLASS TASK 211 Description: If
- Page 235 and 236: A.2. CLASS TASK 213 A.2.16 Task.com
- Page 237 and 238: A.2. CLASS TASK 215 subj : int[] In
- Page 239 and 240: A.2. CLASS TASK 217 firsti : int In
- Page 241 and 242: A.2. CLASS TASK 219 A.2.27 Task.get
- Page 243 and 244: A.2. CLASS TASK 221 valijkl : Descr
- Page 245 and 246: A.2. CLASS TASK 223 A.2.33 Task.get
- Page 247 and 248: A.2. CLASS TASK 225 idx : long Inde
- Page 249 and 250: A.2. CLASS TASK 227 A.2.41 Task.get
- Page 251 and 252: A.2. CLASS TASK 229 i : int Index o
- Page 253 and 254: A.2. CLASS TASK 231 A.2.49 Task.get
- Page 255 and 256: A.2. CLASS TASK 233 conetype : cone
- Page 257 and 258: A.2. CLASS TASK 235 Description: Ob
- Page 259 and 260: A.2. CLASS TASK 237 sub : int[] Ind
- Page 261 and 262: A.2. CLASS TASK 239 A.2.64 Task.get
- Page 263 and 264: A.2. CLASS TASK 241 Computes the vi
- Page 265 and 266: A.2. CLASS TASK 243 A.2.71 Task.get
- Page 267 and 268: A.2. CLASS TASK 245 A.2.75 Task.get
- Page 269: A.2. CLASS TASK 247 A.2.80 Task.get
- Page 273 and 274: A.2. CLASS TASK 251 A.2.92 Task.get
- Page 275 and 276: A.2. CLASS TASK 253 k : int Index o
- Page 277 and 278: A.2. CLASS TASK 255 A.2.103 Task.ge
- Page 279 and 280: A.2. CLASS TASK 257 normalize : int
- Page 281 and 282: A.2. CLASS TASK 259 Description: Le
- Page 283 and 284: A.2. CLASS TASK 261 max(l x j τ
- Page 285 and 286: A.2. CLASS TASK 263 A.2.117 Task.ge
- Page 287 and 288: A.2. CLASS TASK 265 last : int Last
- Page 289 and 290: A.2. CLASS TASK 267 A.2.124 Task.ge
- Page 291 and 292: A.2. CLASS TASK 269 Arguments snx :
- Page 293 and 294: A.2. CLASS TASK 271 slc : double[]
- Page 295 and 296: A.2. CLASS TASK 273 Arguments accmo
- Page 297 and 298: A.2. CLASS TASK 275 A.2.133 Task.ge
- Page 299 and 300: A.2. CLASS TASK 277 last : int Valu
- Page 301 and 302: A.2. CLASS TASK 279 subi : int[] Ro
- Page 303 and 304: A.2. CLASS TASK 281 Description: Ob
- Page 305 and 306: A.2. CLASS TASK 283 Arguments taskn
- Page 307 and 308: A.2. CLASS TASK 285 A.2.148 Task.ge
- Page 309 and 310: A.2. CLASS TASK 287 vartype : varia
- Page 311 and 312: A.2. CLASS TASK 289 whichsol : solt
- Page 313 and 314: A.2. CLASS TASK 291 Description: Ob
- Page 315 and 316: A.2. CLASS TASK 293 A.2.162 Task.is
- Page 317 and 318: A.2. CLASS TASK 295 whichstream : s
- Page 319 and 320: A.2. CLASS TASK 297 A.2.170 Task.pr
248 APPENDIX A. <strong>API</strong> REFERENCE<br />
A.2.83<br />
Task.getmemusage()<br />
meminuse,maxmemuse = Task.getmemusage()<br />
Obtains information about the amount of memory used by a task.<br />
Arguments<br />
maxmemuse : long<br />
Maximum amount of memory used by the task until now.<br />
meminuse : long<br />
Amount of memory currently used by the task.<br />
Description:<br />
Obtains information about the amount of memory used by a task.<br />
A.2.84<br />
Task.getnumanz()<br />
numanz = Task.getnumanz()<br />
Obtains the number of non-zeros in the coefficient matrix.<br />
Arguments<br />
numanz : int<br />
Number of non-zero elements in the linear constraint matrix.<br />
Description:<br />
Obtains the number of non-zeros in A.<br />
A.2.85<br />
Task.getnumanz64()<br />
numanz = Task.getnumanz64()<br />
Obtains the number of non-zeros in the coefficient matrix.<br />
Arguments<br />
numanz : long<br />
Number of non-zero elements in the linear constraint matrix.<br />
Description:<br />
Obtains the number of non-zeros in A.
Change language