I dont know what is wrong with my code? I appropriate any help. cvx_begin variable pv(p1,s) sl2 =norms (pv,2,2) ; minimize norm(sl2,1); cvx_end

Disciplined convex programming error: Cannot perform the operation norm( {convex}, 1 )

Error in minimize (line 14) x = evalin( ‘caller’, sprintf( '%s ', varargin{:} ) );

Perhaps you want minimize sum(sl2)

minimize sum(sl2)

That is a valid but rather uninteresting CVX problem, unless you add some constraints or otherwise modify it. As is, the optimal value of pv will be the matrix of all zeros.

Mark is right—there’s no need to use the second norm there; just use sum instead.

sum