The MOSEK Java optimizer API manual Version 7.0 (Revision 141)
Optimizer API for Java - Documentation - Mosek Optimizer API for Java - Documentation - Mosek
236 APPENDIX A. API REFERENCE Obtains barc in block triplet form. Arguments : long Number of elements in the block triplet form. num : long[] Number of elements in the block triplet form. subj : int[] Symmetric matrix variable index. subk : int[] Block row index. subl : int[] Block column index. 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() Task.getbarcidx( idx, j, num, 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.
A.2. CLASS TASK 237 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() Task.getbarcidxinfo( idx, num) = Task.getbarcidxinfo(idx) Obtains information about an element in barc. Arguments : long Number of terms that appears in weighted that forms the requested element. 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() Task.getbarcidxj( idx, j) Obtains the row index of an element in barc. Arguments
- Page 207 and 208: 13.2. ANALYZING INFEASIBLE PROBLEMS
- Page 209 and 210: Chapter 14 Primal feasibility repai
- Page 211 and 212: 14.2. AUTOMATIC REPAIR 189 One way
- Page 213 and 214: 14.3. FEASIBILITY REPAIR IN MOSEK 1
- Page 215 and 216: 14.3. FEASIBILITY REPAIR IN MOSEK 1
- Page 217 and 218: Chapter 15 Sensitivity analysis 15.
- Page 219 and 220: 15.4. SENSITIVITY ANALYSIS FOR LINE
- Page 221 and 222: 15.4. SENSITIVITY ANALYSIS FOR LINE
- Page 223 and 224: 15.4. SENSITIVITY ANALYSIS FOR LINE
- Page 225 and 226: 15.5. SENSITIVITY ANALYSIS FROM THE
- Page 227 and 228: 15.6. SENSITIVITY ANALYSIS WITH THE
- Page 229 and 230: 15.6. SENSITIVITY ANALYSIS WITH THE
- Page 231 and 232: Appendix A API reference This chapt
- Page 233 and 234: 211 • Task.getdualobj • Task.ge
- Page 235 and 236: A.1. EXCEPTIONS 213 • Task.dualse
- Page 237 and 238: A.2. CLASS TASK 215 A.2.3 Task.anal
- Page 239 and 240: A.2. CLASS TASK 217 • Quadratic c
- Page 241 and 242: A.2. CLASS TASK 219 Arguments num :
- Page 243 and 244: A.2. CLASS TASK 221 A.2.12 Task.bas
- Page 245 and 246: A.2. CLASS TASK 223 Description: Se
- Page 247 and 248: A.2. CLASS TASK 225 A.2.19 Task.get
- Page 249 and 250: A.2. CLASS TASK 227 Arguments : dou
- Page 251 and 252: A.2. CLASS TASK 229 Obtains the num
- Page 253 and 254: A.2. CLASS TASK 231 val : double[]
- Page 255 and 256: A.2. CLASS TASK 233 i, j, num, sub,
- Page 257: A.2. CLASS TASK 235 num : long[] Nu
- Page 261 and 262: A.2. CLASS TASK 239 j : int Index o
- Page 263 and 264: A.2. CLASS TASK 241 Description: Ob
- Page 265 and 266: A.2. CLASS TASK 243 Description: Ob
- Page 267 and 268: A.2. CLASS TASK 245 A.2.50 Task.get
- Page 269 and 270: A.2. CLASS TASK 247 Obtains a name
- Page 271 and 272: A.2. CLASS TASK 249 name : StringBu
- Page 273 and 274: A.2. CLASS TASK 251 last : int Last
- Page 275 and 276: A.2. CLASS TASK 253 sub : int[] Ind
- Page 277 and 278: A.2. CLASS TASK 255 A.2.66 Task.get
- Page 279 and 280: A.2. CLASS TASK 257 viol : double[]
- Page 281 and 282: A.2. CLASS TASK 259 A.2.72 Task.get
- Page 283 and 284: A.2. CLASS TASK 261 A.2.76 Task.get
- Page 285 and 286: A.2. CLASS TASK 263 A.2.80 Task.get
- Page 287 and 288: A.2. CLASS TASK 265 A.2.85 Task.get
- Page 289 and 290: A.2. CLASS TASK 267 A.2.90 Task.get
- Page 291 and 292: A.2. CLASS TASK 269 A.2.95 Task.get
- Page 293 and 294: A.2. CLASS TASK 271 numqcnz : int[]
- Page 295 and 296: A.2. CLASS TASK 273 : string Assign
- Page 297 and 298: A.2. CLASS TASK 275 A.2.109 Task.ge
- Page 299 and 300: A.2. CLASS TASK 277 A.2.112 Task.ge
- Page 301 and 302: A.2. CLASS TASK 279 A.2.116 Task.ge
- Page 303 and 304: A.2. CLASS TASK 281 A.2.119 Task.ge
- Page 305 and 306: A.2. CLASS TASK 283 numqonz : long[
- Page 307 and 308: A.2. CLASS TASK 285 Description: Ob
236 APPENDIX A. <strong>API</strong> REFERENCE<br />
Obtains barc in block triplet form.<br />
Arguments<br />
: long<br />
Number of elements in the block triplet form.<br />
num : long[]<br />
Number of elements in the block triplet form.<br />
subj : int[]<br />
Symmetric matrix variable index.<br />
subk : int[]<br />
Block row index.<br />
subl : int[]<br />
Block column index.<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 />
Task.getbarcidx(<br />
idx,<br />
j,<br />
num,<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.
Change language