The structure of a typical conic optimization problem is

$\begin{split}\begin{array}{lccccl} \mbox{minimize} & & & c^T x+c^f & & \\ \mbox{subject to} & l^c & \leq & A x & \leq & u^c, \\ & l^x & \leq & x & \leq & u^x, \\ & & & Fx+g & \in & \D, \end{array}\end{split}$

(see Sec. 12 (Problem Formulation and Solutions) for detailed formulations). We recommend Sec. 6.2 (From Linear to Conic Optimization) for a tutorial on how problems of that form are represented in MOSEK and what data structures are relevant. Here we discuss how to set-up problems with the (rotated) quadratic cones.

MOSEK supports two types of quadratic cones, namely:

$\Q^n = \left\lbrace x \in \real^n: x_0 \geq \sqrt{\sum_{j=1}^{n-1} x_j^2} \right\rbrace.$

$\Qr^n = \left\lbrace x \in \real^n: 2 x_0 x_1 \geq \sum_{j=2}^{n-1} x_j^2,\quad x_0\geq 0,\quad x_1 \geq 0 \right\rbrace.$

For example, consider the following constraint:

$(x_4, x_0, x_2) \in \Q^3$

which describes a convex cone in $$\real^3$$ given by the inequality:

$x_4 \geq \sqrt{x_0^2 + x_2^2}.$

For other types of cones supported by MOSEK, see Sec. 15.11 (Supported domains) and the other tutorials in this chapter. Different cone types can appear together in one optimization problem.

## 6.3.1 Example CQO1¶

Consider the following conic quadratic problem which involves some linear constraints, a quadratic cone and a rotated quadratic cone.

(6.10)$\begin{split}\begin{array} {lccc} \mbox{minimize} & x_4 + x_5 + x_6 & & \\ \mbox{subject to} & x_1+x_2+ 2 x_3 & = & 1, \\ & x_1,x_2,x_3 & \geq & 0, \\ & x_4 \geq \sqrt{x_1^2 + x_2^2}, & & \\ & 2 x_5 x_6 \geq x_3^2 & & \end{array}\end{split}$

The two conic constraints can be expressed in the ACC form as shown in (6.11)

(6.11)$\begin{split}\left[\begin{array}{cccccc}0&0&0&1&0&0\\1&0&0&0&0&0\\0&1&0&0&0&0\\0&0&0&0&1&0\\0&0&0&0&0&1\\0&0&1&0&0&0\end{array}\right] \left[\begin{array}{c}x_1\\x_2\\x_3\\x_4\\x_5\\x_6\end{array}\right] + \left[\begin{array}{c}0\\0\\0\\0\\0\\0\end{array}\right] \in \Q^3 \times \Q_r^3.\end{split}$

Setting up the linear part

The linear parts (constraints, variables, objective) are set up using exactly the same methods as for linear problems, and we refer to Sec. 6.1 (Linear Optimization) for all the details. The same applies to technical aspects such as defining an optimization task, retrieving the solution and so on.

Setting up the conic constraints

In order to append the conic constraints we first input the matrix $$\afef$$ and vector $$\afeg$$ appearing in (6.11). The matrix $$\afef$$ is sparse and we input only its nonzeros using Task.putafefentrylist. Since $$\afeg$$ is zero, nothing needs to be done about this vector.

Each of the conic constraints is appended using the function Task.appendacc. In the first case we append the quadratic cone determined by the first three rows of $$\afef$$ and then the rotated quadratic cone depending on the remaining three rows of $$\afef$$.

      /* Create a matrix F such that F * x = [x(3),x(0),x(1),x(4),x(5),x(2)] */
task.putafefentrylist(new long[]{0, 1, 2, 3, 4, 5},         /* Rows */
new int[]{3, 0, 1, 4, 5, 2},          /* Columns */
new double[]{1.0, 1.0, 1.0, 1.0, 1.0, 1.0});

new long[]{0, 1, 2},     /* Rows from F */
null);                   /* Unused */

new long[]{3, 4, 5},     /* Rows from F */
null);                   /* Unused */


The first argument selects the domain, which must be appended before being used, and must have the dimension matching the number of affine expressions appearing in the constraint. Variants of this method are available to append multiple ACCs at a time. It is also possible to define the matrix $$\afef$$ using a variety of methods (row after row, column by column, individual entries, etc.) similarly as for the linear constraint matrix $$A$$.

For a more thorough exposition of the affine expression storage (AFE) matrix $$\afef$$ and vector $$\afeg$$ see Sec. 6.2 (From Linear to Conic Optimization).

Source code

Listing 6.4 Source code solving problem (6.10). Click here to download.
package com.mosek.example;

import mosek.*;

public class cqo1 {
static final int numcon = 1;
static final int numvar = 6;

public static void main (String[] args) throws java.lang.Exception {
// Since the value infinity is never used, we define
// 'infinity' symbolic purposes only
double infinity = 0;

mosek.boundkey[] bkc    = { mosek.boundkey.fx };
double[] blc = { 1.0 };
double[] buc = { 1.0 };

mosek.boundkey[] bkx
= {mosek.boundkey.lo,
mosek.boundkey.lo,
mosek.boundkey.lo,
mosek.boundkey.fr,
mosek.boundkey.fr,
mosek.boundkey.fr
};
double[] blx = { 0.0,
0.0,
0.0,
-infinity,
-infinity,
-infinity
};
double[] bux = { +infinity,
+infinity,
+infinity,
+infinity,
+infinity,
+infinity
};

double[] c   = { 0.0,
0.0,
0.0,
1.0,
1.0,
1.0
};

double[][] aval   = {
{1.0},
{1.0},
{2.0}
};
int[][]    asub   = {
{0},
{0},
{0}
};

int[] csub = new int;

// create a new environment object
try (Env  env  = new Env();
// Directs the log task stream to the user specified
mosek.streamtype.log,
new mosek.Stream()
{ public void stream(String msg) { System.out.print(msg); }});

/* Give MOSEK an estimate of the size of the input data.
This is done to increase the speed of inputting data.
However, it is optional. */
/* Append 'numcon' empty constraints.
The constraints will initially have no bounds. */

/* Append 'numvar' variables.
The variables will initially be fixed at zero (x=0). */

/* Optionally add a constant term to the objective. */
for (int j = 0; j < numvar; ++j) {
/* Set the linear term c_j in the objective.*/
/* Set the bounds on variable j.
blx[j] <= x_j <= bux[j] */
}

for (int j = 0; j < aval.length; ++j)
/* Input column j of A */
asub[j],               /* Row index of non-zeros in column j.*/
aval[j]);              /* Non-zero Values of column j. */

/* Set the bounds on constraints.
for i=1, ...,numcon : blc[i] <= constraint i <= buc[i] */
for (int i = 0; i < numcon; ++i)

/* Create a matrix F such that F * x = [x(3),x(0),x(1),x(4),x(5),x(2)] */
task.putafefentrylist(new long[]{0, 1, 2, 3, 4, 5},         /* Rows */
new int[]{3, 0, 1, 4, 5, 2},          /* Columns */
new double[]{1.0, 1.0, 1.0, 1.0, 1.0, 1.0});

new long[]{0, 1, 2},     /* Rows from F */
null);                   /* Unused */

new long[]{3, 4, 5},     /* Rows from F */
null);                   /* Unused */

System.out.println ("optimize");

/* Solve the problem */
System.out.println (" Mosek warning:" + r.toString());
// Print a summary containing information
// about the solution for debugging purposes

/* Get status information about the solution */

double[] xx = task.getxx(mosek.soltype.itr); // Interior solution.

switch (solsta) {
case optimal:
System.out.println("Optimal primal solution\n");
for (int j = 0; j < numvar; ++j)
System.out.println ("x[" + j + "]:" + xx[j]);
break;
case dual_infeas_cer:
case prim_infeas_cer:
System.out.println("Primal or dual infeasibility.\n");
break;
case unknown:
System.out.println("Unknown solution status.\n");
break;
default:
System.out.println("Other solution status");
break;
}
} catch (mosek.Exception e) {
System.out.println ("An error/warning was encountered");
System.out.println (e.toString());
throw e;
}
}
}