10 Technical guidelines¶
This section contains some more in-depth technical guidelines for Optimizer API for Julia, not strictly necessary for basic use of MOSEK.
10.1 Memory management and garbage collection¶
Users who experience memory leaks, especially:
memory usage not decreasing after the solver terminates,
memory usage increasing when solving a sequence of problems,
should observe that the MOSEK task and environment objects are subject to standard garbage collection rules and will be cleaned up by the runtime when they go out of scope.
10.2 Names¶
All elements of an optimization problem in MOSEK (objective, constraints, variables, etc.) can be given names. Assigning meaningful names to variables and constraints makes it much easier to understand and debug optimization problems dumped to a file. On the other hand, note that assigning names can substantially increase setup time, so it should be avoided in time-critical applications.
Names of various elements of the problem can be set and retrieved using various functions listed in the Names section of Sec. 15.2 (Functions grouped by topic).
Note that file formats impose various restrictions on names, so not all names can be written verbatim to each type of file. If at least one name cannot be written to a given format then generic names and substitutions of offending characters will be used when saving to a file, resulting in a transformation of all names in the problem. See Sec. 16 (Supported File Formats).
10.3 Multithreading¶
Thread safety
Sharing a task between threads is safe, as long as it is not accessed from more than one thread at a time. Multiple tasks can be created and used in parallel without any problems.
Parallelization
The interior-point and mixed-integer optimizers in MOSEK are parallelized. By default MOSEK will automatically select the number of threads. However, the maximum number of threads allowed can be changed by setting the parameter MSK_IPAR_NUM_THREADS and related parameters. This should never exceed the number of cores.
The speed-up obtained when using multiple threads is highly problem and hardware dependent. We recommend experimenting with various thread numbers to determine the optimal settings. For small problems using multiple threads may be counter-productive because of the associated overhead. Note also that not all parts of the algorithm can be parallelized, so there are times when CPU utilization is only 1 even if more cores are available.
Determinism
By default the optimizer is run-to-run deterministic, which means that it will return the same answer each time it is run on the same machine with the same input, the same parameter settings (including number of threads) and no time limits.
Setting the number of threads
The number of threads the optimizer uses can be changed with the parameter MSK_IPAR_NUM_THREADS.
10.4 Timing¶
Unless otherwise mentioned all parameters, information items and log output entries in MOSEK which refer to time measurement are expressed in seconds of wall-clock time.
10.5 Efficiency¶
Although MOSEK is implemented to handle memory efficiently, the user may have valuable knowledge about a problem, which could be used to improve the performance of MOSEK This section discusses some tricks and general advice that hopefully make MOSEK process your problem faster.
Reduce the number of function calls and avoid input loops
For example, instead of setting the entries in the linear constraint matrix one by one (putaij) define them all at once (putaijlist) or in convenient large chunks (putacollist etc.)
Use one or no environment
Share the environment between all tasks in one process. For most applications you don’t need an explicit environment at all.
Read part of the solution
When fetching the solution, data has to be copied from the optimizer to the user’s data structures. Instead of fetching the whole solution, consider fetching only the interesting part (see for example getxxslice and similar).
Avoiding memory fragmentation
MOSEK stores the optimization problem in internal data structures in the memory. Initially MOSEK will allocate structures of a certain size, and as more items are added to the problem the structures are reallocated. For large problems the same structures may be reallocated many times causing memory fragmentation. One way to avoid this is to give MOSEK an estimated size of your problem using the functions:
putmaxnumvar. Estimate for the number of variables.putmaxnumcon. Estimate for the number of constraints.putmaxnumbarvar. Estimate for the number of semidefinite matrix variables.putmaxnumanz. Estimate for the number of non-zeros in \(A\).putmaxnumqnz. Estimate for the number of non-zeros in the quadratic terms.
None of these functions changes the problem, they only serve as hints. If the problem ends up growing larger, the estimates are automatically increased.
Do not mix put- and get- functions
MOSEK will queue put- requests internally until a get- function is called. If put- and get- calls are interleaved, the queue will have to be flushed more frequently, decreasing efficiency.
In general get- commands should not be called often (or at all) during problem setup.
Use the LIFO principle
When removing constraints and variables, try to use a LIFO (Last In First Out) approach. MOSEK can more efficiently remove constraints and variables with a high index than a small index.
An alternative to removing a constraint or a variable is to fix it at 0, and set all relevant coefficients to 0. Generally this will not have any impact on the optimization speed.
Add more constraints and variables than you need (now)
The cost of adding one constraint or one variable is about the same as adding many of them. Therefore, it may be worthwhile to add many variables instead of one. Initially fix the unused variable at zero, and then later unfix them as needed. Similarly, you can add multiple free constraints and then use them as needed.
Do not remove basic variables
When performing re-optimizations, instead of removing a basic variable it may be more efficient to fix the variable at zero and then remove it when the problem is re-optimized and it has left the basis. This makes it easier for MOSEK to restart the simplex optimizer.
10.6 The license system¶
MOSEK is a commercial product that always needs a valid license to work. MOSEK uses a third party license manager to implement license checking. The number of license tokens provided determines the number of optimizations that can be run simultaneously.
By default a license token remains checked out from the first optimization until the end of the MOSEK session, i.e.
a license token is checked out when
optimizeis first called, andit is returned when the MOSEK environment is deleted.
Calling optimize from different threads using the same MOSEK environment only consumes one license token.
Starting the optimization when no license tokens are available will result in an error.
Default behaviour of the license system can be changed in several ways:
Setting the parameter
MSK_IPAR_CACHE_LICENSEtoMSK_OFFwill force MOSEK to return the license token immediately after the optimization completed.Setting the license wait flag with the parameter
MSK_IPAR_LICENSE_WAITwill force MOSEK to wait until a license token becomes available instead of returning with an error. The wait time between checks can be set withputlicensewait.Additional license checkouts and checkins can be performed with the functions
checkinlicenseandcheckoutlicense.Usually the license system is stopped automatically when the MOSEK library is unloaded. However, when the user explicitly unloads the library (using e.g. FreeLibrary), the license system must be stopped before the library is unloaded. This can be done by calling the function
licensecleanupas the last function call to MOSEK.
10.7 Deployment¶
When redistributing a Julia application using the MOSEK Optimizer API for Julia 11.0.2(BETA), the following shared libraries from the MOSEK bin folder are required:
Linux :
libmosek64,libtbb,Windows :
mosek64,tbb,OSX :
libmosek64,libtbb.
