Code

Below are various codes related to my papers.

• Code related to Semidefinite Programming and Nash Equilibria in Bimatrix Games

  • nash.m implements the SDP relaxation for computing an approximate Nash equilibrium.

  • nashbound.m implements an SDP relaxation lower bound on the minimum of a quadratic function over the set of Nash equilibria.

  • The data used in the paper.

• Code related to On the Complexity of Testing Attainment of the Optimal Value in Nonlinear Optimization

  • isCoercive.m implements the sos relaxation for testing if a polynomial is coercive. The implementation uses Yalmip.