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.9 (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.put_afe_f_entry_list. Since $$\afeg$$ is zero, nothing needs to be done about this vector.

Each of the conic constraints is appended using the function Task.append_acc. 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$$.

    {
&[3, 0, 1, 4, 5, 2],            // Columns
&[1.0,1.0,1.0,1.0,1.0,1.0])?;

&[0, 1, 2],              // Rows from F
&[0.0,0.0,0.0])?;        // Unused

&[3, 4, 5],              // Rows from F
&[0.0,0.0,0.0])?;        // 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.
fn main() -> Result<(),String>
{
let numvar  : i32 = 6;
let numcon  : i32 = 1;

let bkc = &[ mosek::Boundkey::FX ];
let blc = &[ 1.0 ];
let buc = &[ 1.0 ];

let bkx = &[ mosek::Boundkey::LO,
mosek::Boundkey::LO,
mosek::Boundkey::LO,
mosek::Boundkey::FR,
mosek::Boundkey::FR,
mosek::Boundkey::FR];
let blx = &[ 0.0, 0.0, 0.0, -INF, -INF, -INF ];
let bux = &[ INF, INF, INF,  INF,  INF,  INF ];
let c   = &[ 0.0, 0.0, 0.0,  1.0,  1.0,  1.0 ];

let asub  = &[0, 1, 2];
let aval  = &[1.0, 1.0, 1.0];

/* Create the optimization task. */
Some(e) => e,
None => return Err("Failed to create task".to_string()),
}.with_callbacks();

/* Append 'numcon' empty constraints.
* The constraints will initially have no bounds. */

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

for (j,&cj,&bkj,&blj,&buj) in izip!(0..numvar,c,bkx,blx,bux) {
/* Set the linear term c_j in the objective.*/

/* Set the bounds on variable j.
* blx[j] <= x_j <= bux[j] */
task.put_var_bound( j,    /* Index of variable.*/
bkj,      /* Bound key.*/
blj,      /* Numerical value of lower bound.*/
buj)?;     /* Numerical value of upper bound.*/
}

/* Input columns of A */

/* Set the bounds on constraints.
* for i=1, ...,numcon : blc[i] <= constraint i <= buc[i] */
for (i,&bki,&bli,&bui) in izip!(0..numcon,bkc,blc,buc) {
task.put_con_bound( i,    /* Index of constraint.*/
bki,      /* Bound key.*/
bli,      /* Numerical value of lower bound.*/
bui)?;     /* Numerical value of upper bound.*/
}

/* Append the first cone. */
// Create a matrix F such that F * x = [x(3),x(0),x(1),x(4),x(5),x(2)]
{
&[3, 0, 1, 4, 5, 2],            // Columns
&[1.0,1.0,1.0,1.0,1.0,1.0])?;

&[0, 1, 2],              // Rows from F
&[0.0,0.0,0.0])?;        // Unused

&[3, 4, 5],              // Rows from F
&[0.0,0.0,0.0])?;        // Unused
}

/* Run optimizer */

/* Print a summary containing information
* about the solution for debugging purposes*/

match solsta
{
Solsta::OPTIMAL =>
{
let mut xx = vec![0.0; numvar as usize];
task.get_xx(Soltype::ITR,    /* Request the basic solution. */
xx.as_mut_slice())?;
println!("Optimal primal solution");
for (j,xj) in izip!(0..numvar,xx) {
println!("x[{}]: {}",j,xj);
}
}

Solsta::DUAL_INFEAS_CER |
Solsta::PRIM_INFEAS_CER =>
{
println!("Primal or dual infeasibility certificate found.");
}

Solsta::UNKNOWN => {
/* If the solutions status is unknown, print the termination code
* indicating why the optimizer terminated prematurely. */

println!("The solution status is unknown.");
println!("The optimizer terminitated with code: {}",trm);
}
_ =>
{
println!("Other solution status.");
}
}
Ok(())
} /* main */