Jing Hu

An LPCC Approach to Nonconvex Quadratic Programs

  • Jing Hu
  • John E. Mitchell
  • Jong-Shi Pang
    • Categories Complementarity and Variational Inequalities, Quadratic Programming Tags , , ,

    Filling a gap in nonconvex quadratic programming, this paper shows that the global resolution of a feasible quadratic program (QP), which is not known a priori to be bounded or unbounded below, can be accomplished in finite time by solving a linear program with linear complementarity constraints, i.e., an LPCC. Alternatively, this task can be … Read more

    On the Global Solution of Linear Programs with Linear Complementarity Constraints

  • Kristin P. Bennett
  • Jing Hu
  • John E. Mitchell
  • Gautam Kunapuli
  • Jong-Shi Pang
    • Categories Complementarity and Variational Inequalities

    This paper presents a parameter-free integer-programming based algorithm for the global resolution of a linear program with linear complementarity constraints (LPEC). The cornerstone of the algorithm is a minimax integer program formulation that characterizes and provides certificates for the three outcomes—infeasibility, unboundedness, or solvability—of an LPEC. An extreme point/ray generation scheme in the spirit of … Read more