I had some problems solving with cvx:
‘
cvx_begin
variable P1(2,2) symmetric
variable Y1(10,2)
variable G2(10,7)
minimize norm( X1G2,2 )
subject to
ZY1 == [P1;I_0]
ZG2 == [I_0’;I1]
[P1,(X1Y1)';X1*Y1,P1] == semidefinite(4)
cvx_end
’
Except for the variables set, all of them are known and have appropriate dimensions。Thank you very much for your answer。
Error reported as follows:
Calling SDPT3 4.0: 114 variables, 94 equality constraints
For improved efficiency, SDPT3 is solving the dual problem.
Status: Error
Optimal value (cvx_optval): NaN
The array index must be a positive integer or a logical value.
Error cvx sdpt3>solve (Line 211)
Avec{end}{end+1} = reshape( ( str_3 * str_2 ) * reshape( At(ti,:), nt, nv * m ), nt2 * nv, m );
Error cvx solve (Line 399)
[ x, status, tprec, iters, y ] = shim.solve( At, b, c, cones, params );
Error cvx finish (Line 57)
[ status, result, bound, iters, tol ] = cvx_solve;
Error cvx end (Line 11)
evalin( ‘caller’, ‘cvx_finish’ );
cvx_end