Abstract: A nonconvex-concave minimax quadratic problem is studied in this paper. An efficient alternating algorithm is proposed without any convexification procedures and constraint relaxations. By ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results