The MOSEK Python optimizer API manual Version 7.0 (Revision 141)
Optimizer API for Python - Documentation - Mosek Optimizer API for Python - Documentation - Mosek
354 APPENDIX A. API REFERENCE Arguments subset : int[] Indexes of cones which should be removed. Description: Removes a number conic constraint from the problem. In general, it is much more efficient to remove a cone with a high index than a low index. A.2.261 Task.removecons() Task.removecons(subset) The function removes a number of constraints. Arguments subset : int[] Indexes of constraints which should be removed. Description: See also The function removes a subset of the constraints from the optimization task. This implies that the existing constraints are renumbered, for instance if constraint 5 is removed then constraint 6 becomes constraint 5 and so forth. • Task.appendcons Appends a number of constraints to the optimization task. A.2.262 Task.removevars() Task.removevars(subset) The function removes a number of variables. Arguments subset : int[] Indexes of variables which should be removed. Description: The function removes a subset of the variables from the optimization task. This implies that the existing variables are renumbered, for instance if constraint 5 is removed then constraint 6 becomes constraint 5 and so forth.
A.2. CLASS TASK 355 See also • Task.appendvars Appends a number of variables to the optimization task. A.2.263 Task.resizetask() Task.resizetask( maxnumcon, maxnumvar, maxnumcone, maxnumanz, maxnumqnz) Resizes an optimization task. Arguments maxnumanz : long New maximum number of non-zeros in A. maxnumcon : int New maximum number of constraints. maxnumcone : int New maximum number of cones. maxnumqnz : long New maximum number of non-zeros in all Q matrixes. maxnumvar : int New maximum number of variables. Description: See also Sets the amount of preallocated space assigned for each type of data in an optimization task. It is never mandatory to call this function, since its only function is to give a hint of the amount of data to preallocate for efficiency reasons. Please note that the procedure is destructive in the sense that all existing data stored in the task is destroyed. • Task.putmaxnumvar Sets the number of preallocated variables in the optimization task. • Task.putmaxnumcon Sets the number of preallocated constraints in the optimization task. • Task.putmaxnumcone Sets the number of preallocated conic constraints in the optimization task. • Task.putmaxnumanz The function changes the size of the preallocated storage for linear coefficients. • Task.putmaxnumqnz Changes the size of the preallocated storage for quadratic terms.
- Page 325 and 326: A.2. CLASS TASK 303 A.2.175 Task.pu
- Page 327 and 328: A.2. CLASS TASK 305 j : int Index o
- Page 329 and 330: A.2. CLASS TASK 307 A.2.180 Task.pu
- Page 331 and 332: A.2. CLASS TASK 309 Description: Th
- Page 333 and 334: A.2. CLASS TASK 311 A.2.186 Task.pu
- Page 335 and 336: A.2. CLASS TASK 313 Changes the bou
- Page 337 and 338: A.2. CLASS TASK 315 Modifies one li
- Page 339 and 340: A.2. CLASS TASK 317 bkc : boundkey
- Page 341 and 342: A.2. CLASS TASK 319 Arguments j : i
- Page 343 and 344: A.2. CLASS TASK 321 parvalue : int
- Page 345 and 346: A.2. CLASS TASK 323 A.2.207 Task.pu
- Page 347 and 348: A.2. CLASS TASK 325 Sets a string p
- Page 349 and 350: A.2. CLASS TASK 327 Description: Re
- Page 351 and 352: A.2. CLASS TASK 329 qosubj : int[]
- Page 353 and 354: A.2. CLASS TASK 331 Sets the status
- Page 355 and 356: A.2. CLASS TASK 333 A.2.224 Task.pu
- Page 357 and 358: A.2. CLASS TASK 335 Arguments sux :
- Page 359 and 360: A.2. CLASS TASK 337 y : double[] Ve
- Page 361 and 362: A.2. CLASS TASK 339 A.2.233 Task.pu
- Page 363 and 364: A.2. CLASS TASK 341 last : int Last
- Page 365 and 366: A.2. CLASS TASK 343 See also • Ta
- Page 367 and 368: A.2. CLASS TASK 345 A.2.243 Task.pu
- Page 369 and 370: A.2. CLASS TASK 347 Description: Se
- Page 371 and 372: A.2. CLASS TASK 349 Sets a slice of
- Page 373 and 374: A.2. CLASS TASK 351 A.2.254 Task.re
- Page 375: A.2. CLASS TASK 353 wux : double[]
- Page 379 and 380: A.2. CLASS TASK 357 isdef : int Is
- Page 381 and 382: A.2. CLASS TASK 359 A.2.269 Task.st
- Page 383 and 384: A.2. CLASS TASK 361 Description: Wr
- Page 385 and 386: A.3. CLASS ENV 363 A.2.278 Task.wri
- Page 387 and 388: A.3. CLASS ENV 365 Arguments code :
- Page 389 and 390: A.3. CLASS ENV 367 Arguments keepdl
- Page 391 and 392: A.4. CALLBACK FUNCTIONS AND RELATED
- Page 393 and 394: A.6. ALL FUNCTIONS BY NAME 371 Task
- Page 395 and 396: A.6. ALL FUNCTIONS BY NAME 373 Task
- Page 397 and 398: A.6. ALL FUNCTIONS BY NAME 375 Task
- Page 399 and 400: A.6. ALL FUNCTIONS BY NAME 377 Task
- Page 401 and 402: A.6. ALL FUNCTIONS BY NAME 379 Task
- Page 403 and 404: A.6. ALL FUNCTIONS BY NAME 381 Task
- Page 405 and 406: A.6. ALL FUNCTIONS BY NAME 383 Task
- Page 407 and 408: A.6. ALL FUNCTIONS BY NAME 385 Task
- Page 409 and 410: A.6. ALL FUNCTIONS BY NAME 387 Task
- Page 411 and 412: Appendix B Parameters Parameters gr
- Page 413 and 414: 391 • iparam.log file. If turned
- Page 415 and 416: 393 • dparam.intpnt nl tol rel st
- Page 417 and 418: 395 • iparam.mio construct sol. C
- Page 419 and 420: 397 • dparam.intpnt nl tol mu red
- Page 421 and 422: 399 • iparam.mio mode. Turns on/o
- Page 423 and 424: 401 • iparam.sim solve form. Cont
- Page 425 and 426: B.1. DPARAM: DOUBLE PARAMETERS 403
A.2. CLASS TASK 355<br />
See also<br />
• Task.appendvars Appends a number of variables to the optimization task.<br />
A.2.263<br />
Task.resizetask()<br />
Task.resizetask(<br />
maxnumcon,<br />
maxnumvar,<br />
maxnumcone,<br />
maxnumanz,<br />
maxnumqnz)<br />
Resizes an optimization task.<br />
Arguments<br />
maxnumanz : long<br />
New maximum number of non-zeros in A.<br />
maxnumcon : int<br />
New maximum number of constraints.<br />
maxnumcone : int<br />
New maximum number of cones.<br />
maxnumqnz : long<br />
New maximum number of non-zeros in all Q matrixes.<br />
maxnumvar : int<br />
New maximum number of variables.<br />
Description:<br />
See also<br />
Sets the amount of preallocated space assigned for each type of data in an optimization task.<br />
It is never mandatory to call this function, since its only function is to give a hint of the amount<br />
of data to preallocate for efficiency reasons.<br />
Please note that the procedure is destructive in the sense that all existing data stored in the<br />
task is destroyed.<br />
• Task.putmaxnumvar Sets the number of preallocated variables in the optimization task.<br />
• Task.putmaxnumcon Sets the number of preallocated constraints in the optimization task.<br />
• Task.putmaxnumcone Sets the number of preallocated conic constraints in the optimization<br />
task.<br />
• Task.putmaxnumanz <strong>The</strong> function changes the size of the preallocated storage for linear<br />
coefficients.<br />
• Task.putmaxnumqnz Changes the size of the preallocated storage for quadratic terms.
Change language