Mathematics of Operations Research, Vol. 38, No. 3 (August 2013), pp. 569-590 (22 pages) Farkas' lemma is a fundamental result from linear programming providing linear certificates for infeasibility ...
In this paper, we consider two different formulations (one is smooth and the other one is nonsmooth) for solving linear matrix inequalities (LMIs), an important class of semidefinite programming (SDP) ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback