The MOSEK Python optimizer API manual Version 7.0 (Revision 141)
Optimizer API for Python - Documentation - Mosek Optimizer API for Python - Documentation - Mosek
224 APPENDIX A. API REFERENCE valijkl : double[] A list indexes of the elements from symmetric matrix storage that appers in the weighted sum. Description: Obtains ¯C in block triplet form. A.2.35 Task.getbarcidx() j,num = Task.getbarcidx( idx, sub, weights) Obtains information about an element in barc. Arguments idx : long Index of the element that should be obtained information about. j : int Row index in ¯c. num : long Number of terms in the weighted sum. sub : long[] Elements appearing the weighted sum. weights : double[] Weights of terms in the weighted sum. Description: Obtains information about an element in ¯c. A.2.36 Task.getbarcidxinfo() num = Task.getbarcidxinfo(idx) Obtains information about an element in barc. Arguments
A.2. CLASS TASK 225 idx : long Index of element that should be obtained information about. The value is an index of a symmetric sparse variable. num : long Number of terms that appears in weighted that forms the requested element. Description: Obtains information about about the ¯c ij . A.2.37 Task.getbarcidxj() j = Task.getbarcidxj(idx) Obtains the row index of an element in barc. Arguments idx : long Index of the element that should be obtained information about. j : int Row index in ¯c. Description: Obtains the row index of an element in ¯c. A.2.38 Task.getbarcsparsity() numnz = Task.getbarcsparsity(idxj) Get the positions of the nonzero elements in barc. Arguments idxj : long[] Internal positions of the nonzeros elements in ¯c. numnz : long Number of nonzero elements in ¯C. Description: Internally only the nonzero elements of ¯c is stored in a vector. This function returns which elements ¯c that are nonzero (in subj) and their internal position (in idx). Using the position detailed information about each nonzero ¯C j can be obatined using Task.getbarcidxinfo and Task.getbarcidx.
- Page 195 and 196: 13.2. ANALYZING INFEASIBLE PROBLEMS
- Page 197 and 198: 13.2. ANALYZING INFEASIBLE PROBLEMS
- Page 199 and 200: Chapter 14 Primal feasibility repai
- Page 201 and 202: 14.2. AUTOMATIC REPAIR 179 One way
- Page 203 and 204: 14.3. FEASIBILITY REPAIR IN MOSEK 1
- Page 205 and 206: 14.3. FEASIBILITY REPAIR IN MOSEK 1
- Page 207 and 208: Chapter 15 Sensitivity analysis 15.
- Page 209 and 210: 15.4. SENSITIVITY ANALYSIS FOR LINE
- Page 211 and 212: 15.4. SENSITIVITY ANALYSIS FOR LINE
- Page 213 and 214: 15.4. SENSITIVITY ANALYSIS FOR LINE
- Page 215 and 216: 15.5. SENSITIVITY ANALYSIS FROM THE
- Page 217 and 218: 15.6. SENSITIVITY ANALYSIS WITH THE
- 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: A.2. CLASS TASK 223 A.2.33 Task.get
- 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 and 270: A.2. CLASS TASK 247 A.2.80 Task.get
- Page 271 and 272: A.2. CLASS TASK 249 A.2.86 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
224 APPENDIX A. <strong>API</strong> REFERENCE<br />
valijkl : double[]<br />
A list indexes of the elements from symmetric matrix storage that appers in the weighted<br />
sum.<br />
Description:<br />
Obtains ¯C in block triplet form.<br />
A.2.35<br />
Task.getbarcidx()<br />
j,num = Task.getbarcidx(<br />
idx,<br />
sub,<br />
weights)<br />
Obtains information about an element in barc.<br />
Arguments<br />
idx : long<br />
Index of the element that should be obtained information about.<br />
j : int<br />
Row index in ¯c.<br />
num : long<br />
Number of terms in the weighted sum.<br />
sub : long[]<br />
Elements appearing the weighted sum.<br />
weights : double[]<br />
Weights of terms in the weighted sum.<br />
Description:<br />
Obtains information about an element in ¯c.<br />
A.2.36<br />
Task.getbarcidxinfo()<br />
num = Task.getbarcidxinfo(idx)<br />
Obtains information about an element in barc.<br />
Arguments
Change language