# 6.5 Conic Exponential Optimization¶

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 primal/dual exponential cones.

MOSEK supports two exponential cones, namely:

• Primal exponential cone:

$\EXP = \left\lbrace x \in \real^3: x_0 \geq x_1 \exp(x_2/x_1),\ x_0,x_1\geq 0 \right\rbrace.$
• Dual exponential cone:

$\EXP^* = \left\lbrace s \in \real^3: s_0 \geq -s_2 e^{-1} \exp(s_1/s_2),\ s_2\leq 0,s_0\geq 0 \right\rbrace.$

For example, consider the following constraint:

$(x_4, x_0, x_2) \in \EXP$

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

$x_4 \geq x_0\exp(x_2/x_0),\ x_0,x_4\geq 0.$

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.5.1 Example CEO1¶

Consider the following basic conic exponential problem which involves some linear constraints and an exponential inequality:

(6.15)$\begin{split}\begin{array} {lrcl} \mbox{minimize} & x_0 + x_1 & & \\ \mbox{subject to} & x_0+x_1+x_2 & = & 1, \\ & x_0 & \geq & x_1\exp(x_2/x_1), \\ & x_0, x_1 & \geq & 0. \end{array}\end{split}$

The affine conic form of (6.15) is:

(6.16)$\begin{split}\begin{array} {lrcl} \mbox{minimize} & x_0 + x_1 & & \\ \mbox{subject to} & x_0+x_1+x_2 & = & 1, \\ & Ix & \in & \EXP, \\ & x & \in & \real^3. \end{array}\end{split}$

where $$I$$ is the $$3\times 3$$ identity matrix.

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 sparse identity matrix $$\afef$$ as indicated by (6.16).

The affine conic constraint is then appended using the function Task.append_acc, with the primal exponential domain and the list of $$\afef$$ rows, in this case consisting of all rows in their natural order.

                    task.append_afes(3)?;
let afeidxs = vec![0,  1,  2  ];
let b       = vec![0.0,0.0,0.0];
vec![1,1,1].as_slice(),
vec![0,1,2].as_slice(),
vec![0,1,2].as_slice(),
vec![1.0,1.0,1.0].as_slice())?;


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.6 Source code solving problem (6.15). Click here to download.
extern crate mosek;

const INF : f64 = 0.0;

fn main() -> Result<(),String> {
let numcon = 1;
let numvar = 3;

let bkc = mosek::Boundkey::FX;
let blc = 1.0;
let buc = 1.0;

let bkx = vec![ Boundkey::FR,
Boundkey::FR,
Boundkey::FR ];
let blx = vec![ -INF, -INF, -INF ];
let bux = vec![ INF, INF, INF ];
let c   = vec![ 1.0, 1.0, 0.0 ];
let a   = vec![ 1.0, 1.0, 1.0 ];
let asub = vec![0, 1, 2];
//let csub = new int[numvar];
//double[] xx  = new double[numvar];

/* Create the optimization task. */
.with_stream_callback(
Streamtype::LOG,
&mut|msg| print!("{}",msg),
&mut |caller| { println!("caller = {}",caller); false },
/* Append 'numcon' empty constraints.
The constraints will initially have no bounds. */

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

/* Define the linear part of the problem */

/* Add a conic constraint */
let afeidxs = vec![0,  1,  2  ];
let b       = vec![0.0,0.0,0.0];
vec![1,1,1].as_slice(),
vec![0,1,2].as_slice(),
vec![0,1,2].as_slice(),
vec![1.0,1.0,1.0].as_slice())?;

println!("optimize");
/* Solve the problem */
// Print a summary containing information
// about the solution for debugging purposes

/* Get status information about the solution */

assert!(solsta == Solsta::OPTIMAL);

let mut xx = vec![0.0; numvar as usize];