The MOSEK Python optimizer API manual Version 7.0 (Revision 141)
Optimizer API for Python - Documentation - Mosek Optimizer API for Python - Documentation - Mosek
398 APPENDIX B. PARAMETERS • iparam.log mio. Controls the amount of log information from the mixed-integer optimizers. • iparam.log mio freq. The mixed-integer solver logging frequency. • iparam.log nonconvex. Controls amount of output printed by the nonconvex optimizer. • iparam.log optimizer. logged. Controls the amount of general optimizer information that is • iparam.log order. If turned on, then factor lines are added to the log. • iparam.log param. changes. Controls the amount of information printed out about parameter • iparam.log response. Controls amount of output printed when response codes are reported. A higher level implies that more information is logged. • iparam.log sim. Controls the amount of log information from the simplex optimizers. • iparam.log sim freq. Controls simplex logging frequency. • iparam.log sim minor. Currently not in use. • iparam.log sim network freq. Controls the network simplex logging frequency. • iparam.log storage. Controls the memory related log information. • iparam.max num warnings. Waning level. A higher value results in more warnings. • iparam.warning level. Warning level. Overall solver parameters. • iparam.bi clean optimizer. phase. Controls which simplex optimizer is used in the clean-up • iparam.concurrent num optimizers. The maximum number of simultaneous optimizations that will be started by the concurrent optimizer. • iparam.concurrent priority dual simplex. Priority of the dual simplex algorithm when selecting solvers for concurrent optimization. • iparam.concurrent priority free simplex. Priority of the free simplex optimizer when selecting solvers for concurrent optimization. • iparam.concurrent priority intpnt. Priority of the interior-point algorithm when selecting solvers for concurrent optimization. • iparam.concurrent priority primal simplex. Priority of the primal simplex algorithm when selecting solvers for concurrent optimization. • iparam.infeas prefer primal. Controls which certificate is used if both primal- and dualcertificate of infeasibility is available. • iparam.license wait. Controls if MOSEK should queue for a license if none is available. • iparam.mio cont sol. Controls the meaning of interior-point and basic solutions in mixed integer problems. • iparam.mio local branch number. Controls the size of the local search space when doing local branching.
399 • iparam.mio mode. Turns on/off the mixed-integer mode. • iparam.optimizer. Controls which optimizer is used to optimize the task. • iparam.presolve level. Currently not used. • iparam.presolve use. Controls whether the presolve is applied to a problem before it is optimized. • iparam.solution callback. Indicates whether solution call-backs will be performed during the optimization. Presolve parameters. • iparam.presolve elim fill. Maximum amount of fill-in in the elimination phase. • iparam.presolve eliminator max num tries. Control the maximum number of times the eliminator is tried. • iparam.presolve eliminator use. eliminated from the problem. • iparam.presolve level. Currently not used. Controls whether free or implied free variables are • iparam.presolve lindep abs work trh. Controls linear dependency check in presolve. • iparam.presolve lindep rel work trh. Controls linear dependency check in presolve. • iparam.presolve lindep use. linear dependencies. Controls whether the linear constraints are checked for • dparam.presolve tol abs lindep. Absolute tolerance employed by the linear dependency checker. • dparam.presolve tol aij. Absolute zero tolerance employed for constraint coefficients in the presolve. • dparam.presolve tol rel lindep. Relative tolerance employed by the linear dependency checker. • dparam.presolve tol s. Absolute zero tolerance employed for slack variables in the presolve. • dparam.presolve tol x. Absolute zero tolerance employed for variables in the presolve. • iparam.presolve use. Controls whether the presolve is applied to a problem before it is optimized. Primal simplex optimizer parameters. Parameters defining the behavior of the primal simplex optimizer for linear problems. • iparam.sim primal crash. Controls the simplex crash. • iparam.sim primal restrict selection. Controls how aggressively restricted selection is used. • iparam.sim primal selection. Controls the primal simplex strategy. Progress call-back parameters.
- 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 and 376: A.2. CLASS TASK 353 wux : double[]
- 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: 397 • dparam.intpnt nl tol mu red
- Page 423 and 424: 401 • iparam.sim solve form. Cont
- Page 425 and 426: B.1. DPARAM: DOUBLE PARAMETERS 403
- Page 427 and 428: B.1. DPARAM: DOUBLE PARAMETERS 405
- Page 429 and 430: B.1. DPARAM: DOUBLE PARAMETERS 407
- Page 431 and 432: B.1. DPARAM: DOUBLE PARAMETERS 409
- Page 433 and 434: B.1. DPARAM: DOUBLE PARAMETERS 411
- Page 435 and 436: B.1. DPARAM: DOUBLE PARAMETERS 413
- Page 437 and 438: B.1. DPARAM: DOUBLE PARAMETERS 415
- Page 439 and 440: B.1. DPARAM: DOUBLE PARAMETERS 417
- Page 441 and 442: B.1. DPARAM: DOUBLE PARAMETERS 419
- Page 443 and 444: B.1. DPARAM: DOUBLE PARAMETERS 421
- Page 445 and 446: B.1. DPARAM: DOUBLE PARAMETERS 423
- Page 447 and 448: B.1. DPARAM: DOUBLE PARAMETERS 425
- Page 449 and 450: B.2. IPARAM: INTEGER PARAMETERS 427
- Page 451 and 452: B.2. IPARAM: INTEGER PARAMETERS 429
- Page 453 and 454: B.2. IPARAM: INTEGER PARAMETERS 431
- Page 455 and 456: B.2. IPARAM: INTEGER PARAMETERS 433
- Page 457 and 458: B.2. IPARAM: INTEGER PARAMETERS 435
- Page 459 and 460: B.2. IPARAM: INTEGER PARAMETERS 437
- Page 461 and 462: B.2. IPARAM: INTEGER PARAMETERS 439
- Page 463 and 464: B.2. IPARAM: INTEGER PARAMETERS 441
- Page 465 and 466: B.2. IPARAM: INTEGER PARAMETERS 443
- Page 467 and 468: B.2. IPARAM: INTEGER PARAMETERS 445
- Page 469 and 470: B.2. IPARAM: INTEGER PARAMETERS 447
398 APPENDIX B. PARAMETERS<br />
• iparam.log mio. Controls the amount of log information from the mixed-integer <strong>optimizer</strong>s.<br />
• iparam.log mio freq. <strong>The</strong> mixed-integer solver logging frequency.<br />
• iparam.log nonconvex. Controls amount of output printed by the nonconvex <strong>optimizer</strong>.<br />
• iparam.log <strong>optimizer</strong>.<br />
logged.<br />
Controls the amount of general <strong>optimizer</strong> information that is<br />
• iparam.log order. If turned on, then factor lines are added to the log.<br />
• iparam.log param.<br />
changes.<br />
Controls the amount of information printed out about parameter<br />
• iparam.log response. Controls amount of output printed when response codes are reported.<br />
A higher level implies that more information is logged.<br />
• iparam.log sim. Controls the amount of log information from the simplex <strong>optimizer</strong>s.<br />
• iparam.log sim freq. Controls simplex logging frequency.<br />
• iparam.log sim minor. Currently not in use.<br />
• iparam.log sim network freq. Controls the network simplex logging frequency.<br />
• iparam.log storage. Controls the memory related log information.<br />
• iparam.max num warnings. Waning level. A higher value results in more warnings.<br />
• iparam.warning level. Warning level.<br />
Overall solver parameters.<br />
• iparam.bi clean <strong>optimizer</strong>.<br />
phase.<br />
Controls which simplex <strong>optimizer</strong> is used in the clean-up<br />
• iparam.concurrent num <strong>optimizer</strong>s. <strong>The</strong> maximum number of simultaneous optimizations<br />
that will be started by the concurrent <strong>optimizer</strong>.<br />
• iparam.concurrent priority dual simplex. Priority of the dual simplex algorithm when<br />
selecting solvers for concurrent optimization.<br />
• iparam.concurrent priority free simplex. Priority of the free simplex <strong>optimizer</strong> when<br />
selecting solvers for concurrent optimization.<br />
• iparam.concurrent priority intpnt. Priority of the interior-point algorithm when selecting<br />
solvers for concurrent optimization.<br />
• iparam.concurrent priority primal simplex. Priority of the primal simplex algorithm<br />
when selecting solvers for concurrent optimization.<br />
• iparam.infeas prefer primal. Controls which certificate is used if both primal- and dualcertificate<br />
of infeasibility is available.<br />
• iparam.license wait. Controls if <strong>MOSEK</strong> should queue for a license if none is available.<br />
• iparam.mio cont sol. Controls the meaning of interior-point and basic solutions in mixed<br />
integer problems.<br />
• iparam.mio local branch number. Controls the size of the local search space when doing<br />
local branching.