Closed during Easter 2026

Support and sales are closed for Easter 2026

from Thursday, April 2nd until Monday, April 6th, inclusive.

Contacting us on April 1st is possible, but only with really good pranks, please 🙂.

Best wishes from the MOSEK team.

Guest Speaker Sophie Huiberts: Analyzing the Simplex Method by the Book

On March 17, we are delighted to welcome our guest speaker, Sophie Huiberts, at Mosek office in Copenhagen. Sophie will talk about Simplex method and the gap between theoretical worst case complexity and its observed practical run time. 

If you are curious to learn more, join us at Symbion Park at this publicly open and free event! 

Date and time: 17/3 at 15:00.

Location: Room  M4A ,  Symbion Science Park. (https://www.symbion.dk)
Fruebjergvej 3, 2100 Copenhagen, Denmark

Speaker: Sophie Huiberts, (https://sophie.huiberts.me/)

Title: Analyzing the Simplex Method by the Book
Abstract: The simplex method is an algorithm for linear programming, and this algorithm is much faster than theory is able to explain. In this talk I will describe a new theoretical framework we introduced to address this question. Under this framework, we prove new strong running time guarantees, using mathematical assumptions taken from software user manuals. I will discuss which features of real-world software and LP's we have managed to theoretically capture for this purpose, and what will come next.

Sophie is a CNRS researcher hosted at LIMOS, Clermont Auvergne University in Clermont-Ferrand. And we are happy to welcome her in our office. 

Feel free to join and have a chat with Sophie and the Mosek team !

Closed during Christmas

The MOSEK office, sales and support are not available

December 24-28th and 31st, January 1st.

The MOSEK team

Hello Autumn!

 While there is still some summer temperatures here in Copenhagen, a certain crispness in the signals that autumn is here!

For MOSEK the arrival of autumn means the arrival of of new persons eligible to use MOSEK for free.

This is because MOSEK, through our academic initiative, grants free licenses for research or educational purposes.  By following the link you can see if you are eligible and request an academic license.

The academic license gives access to the full functionality of MOSEK.

Whether you are a new student or a seasoned academic why not use this opportunity to use MOSEK!

MOSEK on AWS marketplace

 MOSEK is now available on AWS marketplace as an AMI (Amazon Machine Image). What that means is that you can initiate an instance with MOSEK installed. 

Well actually, you have to install MOSEK on the machine, but there is a script on the AMI that can do that for you!

What is actually pre-installed on the AMI is a MOSEK license. That means you can run MOSEK without having to worry about license files and MAC- addresses. 

Currently we starting off with a limited number of supported instances, but we look to expand on that offering in the near future. 

Since we are still in an experimental mode we are happy to receive any feedback you might have. It can be about which instances you would like us to support or comments on the documentation and user experience, either way we would like to hear from your!

As always you can reach us at support@mosek.com.  

Introducing MosekCOModel for Rust

A few years a ago we introduced an official rust API for MOSEK. The API extended our optimizer API to the rust language. The optimizer API is designed to be a thin interface to the native C optimizer API.

 However, MOSEK has in addition to the optimizer API also the fusion API. The fusion API is specifically designed to build conic optimization models in a simple and expressive manner. With its focus on model building the fusion API acts as a compliment to the optimizer API. That compliment has now been extended to Rust.

However, due to some language specific attributes of Rust in combination of how the fusion API is constructed there is not a straight forward way to extend the fusion API to Rust. Hence, we like to introduce mosekcomodel!   

The Rust crate mosekcomodel is a Rust package for formulating and solving convex conic optimization models.  While it looks somewhat like the MOSEK fusion API (for Python, Java, .NET and C++), it is a
fully Rust native package exploiting Rust's type system zero-cost abstractions to make it simpler and faster to write correct models.

The crate provides a model-oriented interface for defining conic models and a
library of functionality for formulating affine expressions.

The model

The models that mosekcomodel can formulate has the form 

$min/max$ $c^Tx + c_f$

$subject$ $to:$ $A x + b \in K_1  \times ... \times K_m $

                        $x \in C_1 \times ... \times C_k$

Where $Ax+b$ is an affine expression in the variable $x$ and $K_i$ and $C_i$ are conic sets. Additionally, mosekcomodel supports integer variables and disjunctive constraints  

Currently mosekcomodel supports all cone types that MOSEK supports:

• Linear bounds: Equalities and inequalities,
• Second order conic constraints: Quadric cone and rotated quadratic cone,
• Semidefinite cone and scaled vectorized semidefinite cone,
• primal and dual power cones
• Primal and dual geometric mean cones, and 
• Primal and dual exponential cones.

The API

The three basic concepts in the API are the model, the variable and the constraint.

The model object defines the API for setting up the model and communicating it to an underlying solver. Through this object constraints and variables are created. A variable can be regarded as an n-dimensional array of scalar variables, the dimensionality is part of the type, while the actual dimensions are only defined at runtime. By extension, expressions created from variables are also n-dimensional arrays of scaler affine expressions. When a constraint is created from an expression and a domain, the shape of the expression and the domain must match, and the constraint inherits this dimensionality and shape.

The outline of a simple model could look like this:

Unfortunately, while Rust does allow operator overloading, the definitions for the operators for plus, minus, multiplication and indexing, that would be useful are too restrictive for this use. So for now we are stuck with functions like .add() and .mull()

Constraint expressions are purely linear, and the crate provides functions to create and manipulate expressions: Reshaping, transposing, stacking, slicing and multiplying by matrices, vectors and constants and so on.

Expression evaluation is lazy, meaning that an expression is only evaluated once it is used in a constraint.

Example: Portfolio optimization

The following is a working example of a basic conic quadratic Markowitz portfolio model implemented with mosekcomodel.

Conclusions

While the mosekcomodel is under active development, it is already a very useful tool for formulating optimization models in Rust. What it needs most right now is people using it and giving us feedback!

Geometric Programming Toolbox

As highlighted in a recent linkedIn post by Elmor Peterson Geometric Programming (GP) is an old subfield within optimization with applications in integrated circuit design, aircraft design and control theory amongst others.

Although GP models them self are not convex they can always be converted into a convex model.

To facilitate GP modeling we have made a GP toolbox that makes these transformations for you. To learn more about GP and play around with the toolbox check out the Marimo notebook.

Credit for the notebook goes to our student worker Izgi Tulunay.