The MOSEK Python optimizer API manual Version 7.0 (Revision 141)
Optimizer API for Python - Documentation - Mosek Optimizer API for Python - Documentation - Mosek
352 APPENDIX A. API REFERENCE A.2.257 Task.readtask() Task.readtask(filename) Load task data from a file. Arguments filename : str Input file name. Description: Load task data from a file, replacing any data that already is in the task object. All problem data are resotred, but if the file contains solutions, the solution status after loading a file is still unknown, even if it was optimal or otherwise well-defined when the file was dumped. See section F.4 for a description of the Task format. A.2.258 Task.relaxprimal() relaxedtask = Task.relaxprimal( wlc, wuc, wlx, wux) Deprecated. Arguments relaxedtask : Task The returned task. wlc : double[] Weights associated with lower bounds on the activity of constraints. If negative, the bound is strictly enforced, i.e. if (wl c) i < 0, then (vl c) i is fixed to zero. On return wlc[i] contains the relaxed bound. wlx : double[] Weights associated with lower bounds on the activity of variables. If negative, the bound is strictly enforced, i.e. if (wl x) j < 0 then (vl x) j is fixed to zero. On return wlx[i] contains the relaxed bound. wuc : double[] Weights associated with upper bounds on the activity of constraints. If negative, the bound is strictly enforced, i.e. if (wu) c i < 0, then (vu) c i is fixed to zero. On return wuc[i] contains the relaxed bound.
A.2. CLASS TASK 353 wux : double[] Weights associated with upper bounds on the activity of variables. If negative, the bound is strictly enforced, i.e. if (wu) x j < 0 then (vu) x j is fixed to zero. On return wux[i] contains the relaxed bound. Description: See also Deprecated. Please use Task.primalrepair instead. • dparam.feasrepair tol Tolerance for constraint enforcing upper bound on sum of weighted violations in feasibility repair. • iparam.feasrepair optimize Controls which type of feasibility analysis is to be performed. • sparam.feasrepair name separator Feasibility repair name separator. • sparam.feasrepair name prefix Feasibility repair name prefix. A.2.259 Task.removebarvars() Task.removebarvars(subset) The function removes a number of symmetric matrix. Arguments subset : int[] Indexes of symmetric matrix which should be removed. Description: See also The function removes a subset of the symmetric matrix from the optimization task. This implies that the existing symmetric matrix are renumbered, for instance if constraint 5 is removed then constraint 6 becomes constraint 5 and so forth. • Task.appendbarvars Appends a semidefinite variable of dimension dim to the problem. A.2.260 Task.removecones() Task.removecones(subset) Removes a conic constraint from the problem.
- Page 323 and 324: A.2. CLASS TASK 301 Prints a part o
- 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: A.2. CLASS TASK 351 A.2.254 Task.re
- Page 377 and 378: A.2. CLASS TASK 355 See also • Ta
- 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
A.2. CLASS TASK 353<br />
wux : double[]<br />
Weights associated with upper bounds on the activity of variables. If negative, the bound<br />
is strictly enforced, i.e. if (wu) x j < 0 then (vu) x j is fixed to zero. On return wux[i] contains<br />
the relaxed bound.<br />
Description:<br />
See also<br />
Deprecated. Please use Task.primalrepair instead.<br />
• dparam.feasrepair tol Tolerance for constraint enforcing upper bound on sum of weighted<br />
violations in feasibility repair.<br />
• iparam.feasrepair optimize Controls which type of feasibility analysis is to be performed.<br />
• sparam.feasrepair name separator Feasibility repair name separator.<br />
• sparam.feasrepair name prefix Feasibility repair name prefix.<br />
A.2.259<br />
Task.removebarvars()<br />
Task.removebarvars(subset)<br />
<strong>The</strong> function removes a number of symmetric matrix.<br />
Arguments<br />
subset : int[]<br />
Indexes of symmetric matrix which should be removed.<br />
Description:<br />
See also<br />
<strong>The</strong> function removes a subset of the symmetric matrix from the optimization task. This implies<br />
that the existing symmetric matrix are renumbered, for instance if constraint 5 is removed then<br />
constraint 6 becomes constraint 5 and so forth.<br />
• Task.appendbarvars Appends a semidefinite variable of dimension dim to the problem.<br />
A.2.260<br />
Task.removecones()<br />
Task.removecones(subset)<br />
Removes a conic constraint from the problem.
Change language