Feasible and Infeasible Maxima in aQuadratic Program for

@inproceedings{PelilloUniversit1995FeasibleAI,
  title={Feasible and Infeasible Maxima in aQuadratic Program for},
  author={Maximum CliqueMarcello PelilloUniversit},
  year={1995}
}
  • Maximum CliqueMarcello PelilloUniversit
  • Published 1995
In 1965, Motzkin and Straus related global maximaof a certain quadratic program to the maximum clique size in a certain graph. We extend this result to relate strict local maxima of this program to certain maximal cliques, and certain maxima to non cliques. Our results are useful to a companion paper which employs this QP in a neural net model to nd large cliques in graphs.