Hello Oliver,
I understand that you want to optimize the entire matrix rather than evaluating individual elements within it.
Let's consider an optimization problem involves minimizing the Frobenius norm (which is the square root of the sum of the absolute squares of the matrix elements). The mathematical representation of this optimization problem is:
Minimization of the function over the variable s, with the objective function as
Here, the function “minV” return value of the forbenius norm of the matrix
lambda(i,j) =((x(i) + 1)^s + (x(i)-1)^s) / ((x(i) + 1)^s - (x(i)-1)^s);
V=SA*lambda*transpose(SA);
I hope the above approach resolves your query by considering the minimization of function over some matrix norm.
For further understanding on the function used, please do refer the following documentation: