ng the solution of the QP for the case where a^T*x0 &lt;=b...'</span>);
cvx_begin <span class="string">quiet</span>
    variable <span class="string">xs0(n)</span>
    minimize ( square_pos(norm(xs0 - x0)) )
    a'*xs0 &lt;= b;
cvx_end
fprintf(1,<span class="string">'Done! \n'</span>);

fprintf(1,<span class="string">'Computing the solution of the QP for the case where a^T*x0 &gt; b...'</span>);
cvx_begin <span class="string">quiet</span>
    variable <span class="string">xs1(n)</span>
    minimize ( square