The MOSEK Python optimizer API manual Version 7.0 (Revision 141)
Optimizer API for Python - Documentation - Mosek Optimizer API for Python - Documentation - Mosek
208 APPENDIX A. API REFERENCE A.2.7 Task.appendconesseq() Task.appendconesseq( conetype, conepar, nummem, j) Appends multiple conic constraints to the problem. Arguments conepar : double[] This argument is currently not used. Can be set to 0.0. conetype : conetype Specifies the type of the cone. j : int Index of the first variable in the first cone to be appended. nummem : int[] Number of member variables in the cone. Description: See also Appends a number conic constraints to the problem. The kth cone is assumed to be of dimension nummem[k]. Moreover, is is asummed that the first variable of the first cone has index j and the index of the variable in each cone are sequential. Finally, it assumed in the second cone is the last index of first cone plus one and so forth. • Task.appendcone Appends a new cone constraint to the problem. • Task.appendconeseq Appends a new conic constraint to the problem. A.2.8 Task.appendcons() Task.appendcons(num) Appends a number of constraints to the optimization task. Arguments num : int Number of constraints which should be appended.
A.2. CLASS TASK 209 Description: Appends a number of constraints to the model. Appended constraints will be declared free. Please note that MOSEK will automatically expand the problem dimension to accommodate the additional constraints. See also • Task.removecons The function removes a number of constraints. A.2.9 Task.appendsparsesymmat() idx = Task.appendsparsesymmat( dim, subi, subj, valij) Appends a general sparse symmetric matrix to the vector E of symmetric matrixes. Arguments dim : int Dimension of the symmetric matrix that is appended. idx : long Each matrix that is appended to E is assigned a unique index i.e. idx that can be used for later reference. subi : int[] Row subscript in the triplets. subj : int[] Column subscripts in the triplets. valij : double[] Values of each triplet. Description: MOSEK maintains a storage of symmetric data matrixes that is used to build the ¯c and Ā. The storage can be thought of as a vector of symmetric matrixes denoted E. Hence, E i is a symmetric matrix of certain dimension. This functionsappends a general sparse symmetric matrix on triplet form to the vector E of symmetric matrixes. The vectors subi, subj, and valij contains the row subscripts, column subscripts and values of each element in the symmetric matrix to be appended. Since the matrix that is appended is symmetric then only the lower triangular part should be specified. Moreover, duplicates are not allowed. Observe the function reports the index (position) of the appended matrix in E. should be used for later references to the appended matrix. This index
- Page 179 and 180: 12.3. THE MIXED-INTEGER CONIC OPTIM
- Page 181 and 182: 12.5. TERMINATION CRITERION 159 •
- Page 183 and 184: 12.7. UNDERSTANDING SOLUTION QUALIT
- Page 185 and 186: Chapter 13 The analyzers 13.1 The p
- Page 187 and 188: 13.1. THE PROBLEM ANALYZER 165 Cons
- Page 189 and 190: 13.2. ANALYZING INFEASIBLE PROBLEMS
- Page 191 and 192: 13.2. ANALYZING INFEASIBLE PROBLEMS
- Page 193 and 194: 13.2. ANALYZING INFEASIBLE PROBLEMS
- 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: A.2. CLASS TASK 207 See also • Ro
- 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 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
208 APPENDIX A. <strong>API</strong> REFERENCE<br />
A.2.7<br />
Task.appendconesseq()<br />
Task.appendconesseq(<br />
conetype,<br />
conepar,<br />
nummem,<br />
j)<br />
Appends multiple conic constraints to the problem.<br />
Arguments<br />
conepar : double[]<br />
This argument is currently not used. Can be set to 0.0.<br />
conetype : conetype<br />
Specifies the type of the cone.<br />
j : int<br />
Index of the first variable in the first cone to be appended.<br />
nummem : int[]<br />
Number of member variables in the cone.<br />
Description:<br />
See also<br />
Appends a number conic constraints to the problem. <strong>The</strong> kth cone is assumed to be of dimension<br />
nummem[k]. Moreover, is is asummed that the first variable of the first cone has index j and the<br />
index of the variable in each cone are sequential. Finally, it assumed in the second cone is the<br />
last index of first cone plus one and so forth.<br />
• Task.appendcone Appends a new cone constraint to the problem.<br />
• Task.appendconeseq Appends a new conic constraint to the problem.<br />
A.2.8<br />
Task.appendcons()<br />
Task.appendcons(num)<br />
Appends a number of constraints to the optimization task.<br />
Arguments<br />
num : int<br />
Number of constraints which should be appended.