Linearity Embedded in Nonconvex Programs

This publication has 13 references indexed in Scilit:

• Reduction constraints for the global optimization of NLPs
  International Transactions in Operational Research, 2003
• Reduced first-level representations via the reformulation-linearization technique: results, counterexamples, and computations
  Discrete Applied Mathematics, 2000
• Combinatorial Optimization
  2000
• A Lagrangian Approach to the Pooling Problem
  Industrial & Engineering Chemistry Research, 1999
• A global optimization method, αBB, for general twice-differentiable constrained NLPs — I. Theoretical advances
  Computers & Chemical Engineering, 1998
• A Reduced Space Branch and Bound Algorithm for Global optimization
  Journal of Global Optimization, 1997
• Global optimization of nonconvex NLPs and MINLPs with applications in process design
  Computers & Chemical Engineering, 1995
• A new reformulation-linearization technique for bilinear programming problems
  Journal of Global Optimization, 1992
• Jointly Constrained Biconvex Programming
  Mathematics of Operations Research, 1983
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
  Mathematical Programming, 1976