As showing above， A,B,C,D,X are hermit matrix，the only variable is X. The objective function is (f1-f2), my goal is to maximize (f1-f2), can this problem be solved by D.C programming ? If can , how to deal with it ? Thank you.
As showing above， A,B,C,D,X are hermit matrix，the only variable is X. The objective function is (f1-f2), my goal is to maximize (f1-f2), can this problem be solved by D.C programming ? If can , how to deal with it ? Thank you.