The MOSEK Python optimizer API manual Version 7.0 (Revision 141)
Optimizer API for Python - Documentation - Mosek Optimizer API for Python - Documentation - Mosek
72 CHAPTER 5. BASIC API TUTORIAL 5.13.2 Vector formats Three different vector formats are used in the MOSEK API: Full vector: This is simply an array where the first element corresponds to the first item, the second element to the second item etc. For example to get the linear coefficients of the objective in task, one would write c = zeros(numvar,float) task.getc(c) where numvar is the number of variables in the problem. Vector slice: A vector slice is a range of values. For example, to get the bounds associated constraint 3 through 10 (both inclusive) one would write upper bound = zeros(8,float) lower bound = zeros(8,float) bound key = array([None] * 8) task.getboundslice(accmode.con, 2, 10, bound key,lower bound,upper bound) Please note that items in MOSEK are numbered from 0 , so that the index of the first item is 0 , and the index of the n ’th item is n − 1. Sparse vector: A sparse vector is given as an array of indexes and an array of values. For example, to input a set of bounds associated with constraints number 1, 6, 3, and 9, one might write bound index = [ 1, 6, 3, 9] bound key = [boundkey.fr,boundkey.lo,boundkey.up,boundkey.fx] lower bound = [ 0.0, -10.0, 0.0, 5.0] upper bound = [ 0.0, 0.0, 6.0, 5.0] task.putboundlist(accmode.con, bound index, bound key,lower bound,upper bound) Note that the list of indexes need not be ordered. 5.13.3 Matrix formats The coefficient matrices in a problem are inputted and extracted in a sparse format, either as complete or a partial matrices. Basically there are two different formats for this.
5.13. CONVENTIONS EMPLOYED IN THE API 73 5.13.3.1 Unordered triplets In unordered triplet format each entry is defined as a row index, a column index and a coefficient. For example, to input the A matrix coefficients for a 1,2 = 1.1 , a 3,3 = 4.3 , and a 5,4 = 0.2 , one would write as follows: subi = array([ 1, 3, 5 ]) subj = array([ 2, 3, 4 ]) cof = array([ 1.1, 4.3, 0.2 ]) task.putaijlist(subi,subj,cof) Please note that in some cases (like Task.putaijlist) only the specified indexes remain modified — all other are unchanged. In other cases (such as Task.putqconk) the triplet format is used to modify all entries — entries that are not specified are set to 0. 5.13.3.2 Row or column ordered sparse matrix In a sparse matrix format only the non-zero entries of the matrix are stored. MOSEK uses a sparse packed matrix format ordered either by rows or columns. In the column-wise format the position of the non-zeros are given as a list of row indexes. In the row-wise format the position of the non-zeros are given as a list of column indexes. Values of the non-zero entries are given in column or row order. A sparse matrix in column ordered format consists of: asub: aval: ptrb: ptre: List of row indexes. List of non-zero entries of A ordered by columns. Where ptrb[j] is the position of the first value/index in aval / asub for column j. Where ptre[j] is the position of the last value/index plus one in aval / asub for column j. The values of a matrix A with numcol columns are assigned so that for We define j = 0, . . . , numcol − 1. As an example consider the matrix a asub[k],j = aval[k], k = ptrb[j], . . . , ptre[j] − 1.
- Page 43 and 44: Chapter 5 Basic API tutorial In thi
- Page 45 and 46: 5.1. THE BASICS 23 5 # 6 # Purpose:
- Page 47 and 48: 5.2. LINEAR OPTIMIZATION 25 and the
- Page 49 and 50: 5.2. LINEAR OPTIMIZATION 27 Load a
- Page 51 and 52: 5.2. LINEAR OPTIMIZATION 29 Optimiz
- Page 53 and 54: 5.2. LINEAR OPTIMIZATION 31 88 task
- Page 55 and 56: 5.2. LINEAR OPTIMIZATION 33 51 mose
- Page 57 and 58: 5.3. CONIC QUADRATIC OPTIMIZATION 3
- Page 59 and 60: 5.3. CONIC QUADRATIC OPTIMIZATION 3
- Page 61 and 62: 5.4. SEMIDEFINITE OPTIMIZATION 39 m
- Page 63 and 64: 5.4. SEMIDEFINITE OPTIMIZATION 41 4
- Page 65 and 66: 5.4. SEMIDEFINITE OPTIMIZATION 43 1
- Page 67 and 68: 5.5. QUADRATIC OPTIMIZATION 45 with
- Page 69 and 70: 5.5. QUADRATIC OPTIMIZATION 47 68 #
- Page 71 and 72: 5.5. QUADRATIC OPTIMIZATION 49 5.5.
- Page 73 and 74: 5.5. QUADRATIC OPTIMIZATION 51 81 a
- Page 75 and 76: 5.6. THE SOLUTION SUMMARY 53 • Th
- Page 77 and 78: 5.7. INTEGER OPTIMIZATION 55 21 # f
- Page 79 and 80: 5.7. INTEGER OPTIMIZATION 57 137 sy
- Page 81 and 82: 5.8. THE SOLUTION SUMMARY FOR MIXED
- Page 83 and 84: 5.9. RESPONSE HANDLING 61 Note that
- Page 85 and 86: 5.10. PROBLEM MODIFICATION AND REOP
- Page 87 and 88: 5.10. PROBLEM MODIFICATION AND REOP
- Page 89 and 90: 5.11. SOLUTION ANALYSIS 67 151 # Pu
- Page 91 and 92: 5.13. CONVENTIONS EMPLOYED IN THE A
- Page 93: 5.13. CONVENTIONS EMPLOYED IN THE A
- Page 97 and 98: 5.13. CONVENTIONS EMPLOYED IN THE A
- Page 99 and 100: Chapter 6 Nonlinear API tutorial Th
- Page 101 and 102: 6.1. SEPARABLE CONVEX (SCOPT) INTER
- Page 103 and 104: 6.1. SEPARABLE CONVEX (SCOPT) INTER
- Page 105 and 106: 6.1. SEPARABLE CONVEX (SCOPT) INTER
- Page 107 and 108: Chapter 7 Advanced API tutorial Thi
- Page 109 and 110: 7.1. THE PROGRESS CALL-BACK 87 71 p
- Page 111 and 112: 7.2. SOLVING LINEAR SYSTEMS INVOLVI
- Page 113 and 114: 7.2. SOLVING LINEAR SYSTEMS INVOLVI
- Page 115 and 116: 7.2. SOLVING LINEAR SYSTEMS INVOLVI
- Page 117 and 118: 7.2. SOLVING LINEAR SYSTEMS INVOLVI
- Page 119 and 120: Chapter 8 A case study 8.1 Portfoli
- Page 121 and 122: 8.1. PORTFOLIO OPTIMIZATION 99 e T
- Page 123 and 124: 8.1. PORTFOLIO OPTIMIZATION 101 is
- Page 125 and 126: 8.1. PORTFOLIO OPTIMIZATION 103 15
- Page 127 and 128: 8.1. PORTFOLIO OPTIMIZATION 105 63
- Page 129 and 130: 8.1. PORTFOLIO OPTIMIZATION 107 8.1
- Page 131 and 132: 8.1. PORTFOLIO OPTIMIZATION 109 110
- Page 133 and 134: 8.1. PORTFOLIO OPTIMIZATION 111 z j
- Page 135 and 136: 8.1. PORTFOLIO OPTIMIZATION 113 Var
- Page 137 and 138: 8.1. PORTFOLIO OPTIMIZATION 115 56
- Page 139 and 140: 8.1. PORTFOLIO OPTIMIZATION 117 172
- Page 141 and 142: Chapter 9 Usage guidelines The purp
- Page 143 and 144: 9.3. WRITING TASK DATA TO A FILE 12
5.13. CONVENTIONS EMPLOYED IN THE <strong>API</strong> 73<br />
5.13.3.1 Unordered triplets<br />
In unordered triplet format each entry is defined as a row index, a column index and a coefficient. For<br />
example, to input the A matrix coefficients for a 1,2 = 1.1 , a 3,3 = 4.3 , and a 5,4 = 0.2 , one would<br />
write as follows:<br />
subi = array([ 1, 3, 5 ])<br />
subj = array([ 2, 3, 4 ])<br />
cof = array([ 1.1, 4.3, 0.2 ])<br />
task.putaijlist(subi,subj,cof)<br />
Please note that in some cases (like Task.putaijlist) only the specified indexes remain modified —<br />
all other are unchanged. In other cases (such as Task.putqconk) the triplet format is used to modify<br />
all entries — entries that are not specified are set to 0.<br />
5.13.3.2 Row or column ordered sparse matrix<br />
In a sparse matrix format only the non-zero entries of the matrix are stored. <strong>MOSEK</strong> uses a sparse<br />
packed matrix format ordered either by rows or columns. In the column-wise format the position of<br />
the non-zeros are given as a list of row indexes. In the row-wise format the position of the non-zeros<br />
are given as a list of column indexes. Values of the non-zero entries are given in column or row order.<br />
A sparse matrix in column ordered format consists of:<br />
asub:<br />
aval:<br />
ptrb:<br />
ptre:<br />
List of row indexes.<br />
List of non-zero entries of A ordered by columns.<br />
Where ptrb[j] is the position of the first value/index in aval / asub for column j.<br />
Where ptre[j] is the position of the last value/index plus one in aval / asub for column j.<br />
<strong>The</strong> values of a matrix A with numcol columns are assigned so that for<br />
We define<br />
j = 0, . . . , numcol − 1.<br />
As an example consider the matrix<br />
a asub[k],j = aval[k], k = ptrb[j], . . . , ptre[j] − 1.