Now showing items 1-1 of 1

    • On convex quadratic programs with linear complementarity constraints 

      Bai, Lijie (Rensselaer Polytechnic Institute, Troy, NY, 2013-08)
      In Chapter 2, we show that the global resolution of a general convex quadratic program with complementarity constraints (QPCC), possibly infeasible or unbounded, can be accomplished in finite time. The method constructs a ...