# 6.5 Conic Exponential Optimization¶

Conic optimization is a generalization of linear optimization, allowing constraints of the type

$x^t \in \K_t,$

where $$x^t$$ is a subset of the problem variables and $$\K_t$$ is a convex cone. Since the set $$\real^n$$ of real numbers is also a convex cone, we can simply write a compound conic constraint $$x\in \K$$ where $$\K=\K_1\times\cdots\times\K_l$$ is a product of smaller cones and $$x$$ is the full problem variable.

MOSEK can solve conic optimization problems of the form

$\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, \\ & & & x \in \K, & & \end{array}\end{split}$

where the domain restriction, $$x \in \K$$, implies that all variables are partitioned into convex cones

$x = (x^0, x^1, \ldots , x^{p-1}),\quad \mbox{with } x^t \in \K_t \subseteq \real^{n_t}.$

In this tutorial we describe how to use the primal exponential cone defined as:

$\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.$

MOSEK also supports the 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 other types of cones supported by MOSEK see Sec. 6.3 (Conic Quadratic Optimization), Sec. 6.4 (Power Cone Optimization), Sec. 6.6 (Semidefinite Optimization). Different cone types can appear together in one optimization problem.

For example, the following constraint:

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

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.$

Furthermore, each variable may belong to one cone at most. The constraint $$x_i - x_j = 0$$ would however allow $$x_i$$ and $$x_j$$ to belong to different cones with same effect.

## 6.5.1 Example CEO1¶

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

(6.8)$\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 conic form of (6.8) is:

(6.9)$\begin{split}\begin{array} {lrcl} \mbox{minimize} & x_0 + x_1 & & \\ \mbox{subject to} & x_0+x_1+x_2 & = & 1, \\ & (x_0,x_1,x_2) & \in & \EXP, \\ & x & \in & \real^3. \end{array}\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

The conic constraints are specified as columns in a list-typed matrix called cones, with rows for each associated detail. In example (6.9) we have one conic constraint:

    NUMCONES <- 1
prob$cones <- matrix(list(), nrow=2, ncol=NUMCONES) rownames(prob$cones) <- c("type","sub")

prob$cones[,1] <- list("PEXP", c(1, 2, 3))  The first row selects the type of cone, in this case the exponential cone "MSK_CT_PEXP", noting that the prefix MSK_CT_ is optional. The second row selects the vector of variables constrained to the cone, identified by index (counting from one in the R language). Source code Listing 6.5 Source code solving problem (6.8). Click here to download. library("Rmosek") ceo1 <- function() { # Specify the non-conic part of the problem. prob <- list(sense="min") prob$c  <- c(1, 1, 0)
prob$A <- Matrix(c(1, 1, 1), nrow=1, sparse=TRUE) prob$bc <- rbind(blc=1,
buc=1)
prob$bx <- rbind(blx=rep(-Inf,3), bux=rep( Inf,3)) # Specify the cones. NUMCONES <- 1 prob$cones <- matrix(list(), nrow=2, ncol=NUMCONES)
rownames(prob$cones) <- c("type","sub") prob$cones[,1] <- list("PEXP", c(1, 2, 3))

# Solve the problem
r <- mosek(prob)

# Return the solution
stopifnot(identical(r$response$code, 0))
r\$sol
}

ceo1()