6.4 Power Cone Optimization¶
The structure of a typical conic optimization problem is
(see Sec. 12 (Problem Formulation and Solutions) for detailed formulations). Here we discuss how to set-up problems with the primal/dual power cones.
MOSEK supports the primal and dual power cones, defined as below:
Primal power cone:
\[\POW_n^{\alpha_k} = \left\{ x\in \real^n ~:~ \prod_{i=0}^{n_\ell-1} x_i^{\beta_i} \geq \sqrt{\sum_{j=n_\ell}^{n-1}x_j^2},\ x_0\ldots,x_{n_\ell-1}\geq 0 \right\}\]where \(s = \sum_i \alpha_i\) and \(\beta_i = \alpha_i / s\), so that \(\sum_i \beta_i=1\).
Dual power cone:
\[(\POW_n^{\alpha_k}) = \left\{ x\in \real^n ~:~ \prod_{i=0}^{n_\ell-1} \left(\frac{x_i}{\beta_i}\right)^{\beta_i} \geq \sqrt{\sum_{j=n_\ell}^{n-1}x_j^2},\ x_0\ldots,x_{n_\ell-1}\geq 0 \right\}\]where \(s = \sum_i \alpha_i\) and \(\beta_i = \alpha_i / s\), so that \(\sum_i \beta_i=1\).
Perhaps the most important special case is the three-dimensional power cone family:
which has the corresponding dual cone:
For example, the conic constraint \((x,y,z)\in\POW_3^{0.25,0.75}\) is equivalent to \(x^{0.25}y^{0.75}\geq |z|\), or simply \(xy^3\geq z^4\) with \(x,y\geq 0\).
For other types of cones supported by MOSEK, see Sec. 15.8 (Supported domains) and the other tutorials in this chapter. Different cone types can appear together in one optimization problem.
6.4.1 Example POW1¶
Consider the following optimization problem which involves powers of variables:
We convert (6.12) into affine conic form using auxiliary variables as bounds for the power expressions:
The two conic constraints shown in (6.13) can be expressed in the ACC form as shown in (6.14):
(6.14)¶\[\begin{split}\left[\begin{array}{ccccc}1&0&0&0&0\\0&1&0&0&0\\0&0&0&1&0\\0&0&1&0&0\\0&0&0&0&0\\0&0&0&0&1\end{array}\right] \left[\begin{array}{c}x_0\\x_1\\x_2\\x_3\\x_4\end{array}\right] + \left[\begin{array}{c}0\\0\\0\\0\\1\\0\end{array}\right] \in \POW^{0.2,0.8}_3 \times \POW^{0.4,0.6}_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\) which together determine all the six affine expressions appearing in the conic constraints of (6.13)
# Input the cones
pc1 = appendprimalpowerconedomain(task,3,[0.2, 0.8])
pc2 = appendprimalpowerconedomain(task,3,[4.0, 6.0])
appendafes(task,6)
putafefentrylist(task,
[1, 2, 3, 4, 6], # Rows
[1, 2, 4, 3, 5], #Columns
[1.0, 1.0, 1.0, 1.0, 1.0])
putafeg(task,5,1.0)
# Append the two conic constraints
appendacc(task,
pc1, # Domain
[1, 2, 3], # Rows from F
nothing)
appendacc(task,
pc2, # Domain
[4, 5, 6], # Rows from F
nothing)
Following that, each of the affine conic constraints is appended using the function appendacc. 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. In the first case we append the power cone determined by the first three rows of \(\afef\) and \(\afeg\) while in the second call we use the remaining three rows of \(\afef\) and \(\afeg\).
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
using Mosek
printstream(msg::AbstractString) = print(msg)
csub = [ 4, 5, 1 ]
cval = [ 1.0, 1.0, -1.0]
asub = [ 1, 2, 3]
aval = [ 1.0, 1.0, 0.5]
numvar = 5
numcon = 1
# Create a task
maketask() do task
# Use remote server: putoptserverhost(task,"http://solve.mosek.com:30080")
putstreamfunc(task,MSK_STREAM_LOG,msg -> print(msg))
appendcons(task,numcon)
appendvars(task,numvar)
# Set up the linear part of the problem
putclist(task,csub, cval)
putarow(task,1, asub, aval)
putconbound(task,1, MSK_BK_FX, 2.0, 2.0)
putvarboundsliceconst(task,1, numvar+1,MSK_BK_FR,-Inf,Inf)
# Input the cones
pc1 = appendprimalpowerconedomain(task,3,[0.2, 0.8])
pc2 = appendprimalpowerconedomain(task,3,[4.0, 6.0])
appendafes(task,6)
putafefentrylist(task,
[1, 2, 3, 4, 6], # Rows
[1, 2, 4, 3, 5], #Columns
[1.0, 1.0, 1.0, 1.0, 1.0])
putafeg(task,5,1.0)
# Append the two conic constraints
appendacc(task,
pc1, # Domain
[1, 2, 3], # Rows from F
nothing)
appendacc(task,
pc2, # Domain
[4, 5, 6], # Rows from F
nothing)
# Input the objective sense (minimize/maximize)
putobjsense(task,MSK_OBJECTIVE_SENSE_MAXIMIZE)
# Optimize the task
optimize(task)
writedata(task,"pow1.ptf")
# Print a summary containing information
# about the solution for debugging purposes
solutionsummary(task,MSK_STREAM_MSG)
prosta = getprosta(task,MSK_SOL_ITR)
solsta = getsolsta(task,MSK_SOL_ITR)
if solsta == MSK_SOL_STA_OPTIMAL
# Output a solution
xx = getxx(task,MSK_SOL_ITR)
println("Optimal solution: $(xx[1:3])")
elseif solsta == MSK_SOL_STA_DUAL_INFEAS_CER
println("Primal or dual infeasibility.")
elseif solsta == MSK_SOL_STA_PRIM_INFEAS_CER
println("Primal or dual infeasibility.")
elseif solsta == MSK_SOL_STA_UNKNOWN
println("Unknown solution status")
else
println("Other solution status")
end
end
