libMC References

  1. Mitsos, A., B. Chachuat, and P. I. Barton.
    McCormick-Based Relaxations of Algorithms.
    SIAM Journal on Optimization, 20(2):573-601, 2009.
    DOI:10.1137/080717341
  2. Kumar, A. V.
    A Nonsmooth Exclusion Test for Finding All Solutions of Nonlinear Equations.
    MSc thesis, Massachusetts Institute of Technology, 2007.
    Full text: PDF
  3. McCormick, G. P.
    Computability of Global Solutions to Factorable Nonconvex Programs. Part I: Convex Underestimating Problems.
    Mathematical Programming, 10:147-175, 1976.
    DOI: 10.1007/BF01580665