qpipopt Solves a linear quadratic problem. xopt = qpipopt(nbVar,nbCon,H,f,lb,ub,A,conLB,conUB) xopt = qpipopt(nbVar,nbCon,H,f,lb,ub,A,conLB,conUB,x0) xopt = qpipopt(nbVar,nbCon,H,f,lb,ub,A,conLB,conUB,x0,options) [xopt,fopt,exitflag,output,lamda] = qpipopt( ... ) nbVar : A double, denoting the number of variables nbCon : A double, denoting the number of constraints H : A symmetric matrix of doubles, representing the Hessian of the quadratic problem. f : A vector of doubles, representing coefficients of the linear terms in the quadratic problem. lb : A vector of doubles, containing the lower bounds of the variables. ub : A vector of doubles, containing the upper bounds of the variables. A : A matrix of doubles, representing the constraint matrix in conLB ≤ A⋅x ≤ conUB. conLB : A vector of doubles, containing the lower bounds of the constraints conLB ≤ A⋅x ≤ conUB. conUB : A vector of doubles, containing the upper bounds of the constraints conLB ≤ A⋅x ≤ conUB. x0 : A vector of doubles, containing the starting values of variables of size (1 X n) or (n X 1) where 'n' is the number of variables. options : A list, containing the option for user to specify. See below for details. xopt : A vector of doubles, containing the computed solution of the optimization problem. fopt : A double, containing the value of the function at xopt. exitflag : An integer, containing the flag which denotes the reason for termination of algorithm. See below for details. output : A structure, containing the information about the optimization. See below for details. lambda : A structure, containing the Lagrange multipliers of the lower bounds, upper bounds and constraints at the optimized point. See below for details. Search the minimum of a constrained linear quadratic optimization problem specified by : \begin{eqnarray} \hspace{1pt} \mbox{min}_{x} 1/2⋅x^T⋅H⋅x + f^T⋅x \\ \hspace{1pt} \text{Subjected to: } conLB \leq A⋅x \leq conUB \\ \hspace{70pt} lb \leq x \leq ub \\ \end{eqnarray} qpipopt calls Ipopt, an optimization library written in C++, to solve the optimization problem. The options allow the user to set various parameters of the Optimization problem. The syntax for the options is given by: options= list("MaxIter", [---], "CpuTime", [---], "GradObj", ---, "Hessian", ---, "GradCon", ---); The options should be defined as type "list" and consist of the following fields: MaxIter : A Scalar, specifying the maximum number of iterations that the solver should take. CpuTime : A Scalar, specifying the maximum amount of CPU time in seconds that the solver should take. The default values for the various items are given as: options = list("MaxIter", [3000], "CpuTime", [600]); The exitflag allows the user to know the status of the optimization which is returned by Ipopt. The values it can take and what they indicate is described below: 0 : Optimal Solution Found 1 : Maximum Number of Iterations Exceeded. Output may not be optimal. 2 : Maximum amount of CPU Time exceeded. Output may not be optimal. 3 : Stop at Tiny Step. 4 : Solved To Acceptable Level. 5 : Converged to a point of local infeasibility. For more details on exitflag, see the Ipopt documentation which can be found on http://www.coin-or.org/Ipopt/documentation/ The output data structure contains detailed information about the optimization process. It is of type "struct" and contains the following fields. output.iterations: The number of iterations performed. output.constrviolation: The max-norm of the constraint violation. The lambda data structure contains the Lagrange multipliers at the end of optimization. In the current version, the values are returned only when the the solution is optimal. It has type "struct" and contains the following fields. lambda.lower: The Lagrange multipliers for the lower bound constraints. lambda.upper: The Lagrange multipliers for the upper bound constraints. lambda.eqlin: The Lagrange multipliers for the linear equality constraints. lambda.ineqlin: The Lagrange multipliers for the linear inequality constraints. A few examples displaying the various functionalities of qpipopt have been provided below. You will find a series of problems and the appropriate code snippets to solve them. We begin with a quadratic objective functions, subjected to two bounds for the functions, and two bounds for the constraints. Find x in R^2 such that it minimizes: \begin{eqnarray} \mbox{min}_{x} -8x_{1}^{2} -16x_{2}^{2} + x_{1} + 4x_{2} \\ \end{eqnarray} \\ \hspace{1pt} & \text{Subjected to}\\ \begin{eqnarray} -\infty &\leq 2x_{1} &\leq 5\\ -\infty &\leq x_{2} &\leq 3\\ 0 &\leq x_{1} &\leq \infty\\ 0 &\leq x_{2} &\leq \infty \end{eqnarray} = 0, // x2 >= 0 H = [-16 0; 0 8]; f = [-8; -16]; A = [1 1;1 0]; conUB = [5;3]; conLB = [-%inf; -%inf]; lb = [0; 0]; ub = [%inf; %inf]; nbVar = 2; nbCon = 2; [xopt,fopt,exitflag,output,lambda] = qpipopt(nbVar,nbCon,H,f,lb,ub,A,conLB,conUB) //Press ENTER to continue ]]> We build on the previous example by providing a starting point, to facilitate the computation. \begin{eqnarray} \mbox{min}_{x} -8x_{1}^{2} -16x_{2}^{2} + x_{1} + 4x_{2} \\ \end{eqnarray} \\ & \text{Subjected to}\\ \begin{eqnarray} -\infty &\leq x_{1} +x_{2} &\leq 5\\ -\infty &\leq x_{1} &\leq 3\\ 0 &\leq x_{1} &\leq \infty\\ 0 &\leq x_{2} &\leq \infty \end{eqnarray} We can further enhance the functionality of qpipopt by setting input options. This provides us with the ability to control the solver parameters such as the maximum number of solver iterations and the max. CPU time allowed for the computation. \begin{eqnarray} \mbox{min}_{x} -8x_{1}^{2} -16x_{2}^{2} + x_{1} + 4x_{2} \\ \end{eqnarray} \\ & \text{Subjected to}\\ \begin{eqnarray} -\infty &\leq x_{1} +x_{2} &\leq 5\\ -\infty &\leq x_{1} &\leq 3\\ 0 &\leq x_{1} &\leq \infty\\ 0 &\leq x_{2} &\leq \infty \end{eqnarray} Infeasible Problems: Find x in R^2 such that it minimizes: \begin{eqnarray} \mbox{min}_{x} -8x_{1}^{2} -16x_{2}^{2} + x_{1} + 4x_{2} \\ \end{eqnarray} \\ \hspace{1pt} & \text{Subjected to}\\ \begin{eqnarray} -\infty &\leq 2x_{1} &\leq 5\\ -\infty &\leq x_{2} &\leq 3\\ 4 &\leq x_{1} &\leq \infty\\ 0 &\leq x_{2} &\leq \infty \end{eqnarray} = 0, // x2 >= 0 H = [-16 0; 0 8]; f = [-8; -16]; A = [1 1;1 0] conUB = [5;3]; conLB = [-%inf; -%inf]; lb = [4; 0]; ub = [%inf; %inf]; nbVar = 2; nbCon = 2; [xopt,fopt,exitflag,output,lambda] = qpipopt(nbVar,nbCon,H,f,lb,ub,A,conLB,conUB) //Press ENTER to continue ]]> Unbounded Problems: Find x in R^2 such that it minimizes: \begin{eqnarray} \mbox{min}_{x} -8x_{1}^{2} -16x_{2}^{2} + x_{1} + 4x_{2} \\ \end{eqnarray}\\ & \text{Subjected to}\\ \begin{eqnarray} -\infty &\leq 2x_{1} &\geq -5\\ -\infty &\leq x_{2} &\leq 3\\ 0 &\leq x_{1} &\leq \infty\\ 0 &\leq x_{2} &\leq \infty \end{eqnarray} Keyur Joshi, Saikiran, Iswarya, Harpreet Singh