Canonical DC programming problem: Outer approximation methods revisited

This publication has 13 references indexed in Scilit:

• Comments on a reverse convex programming algorithm
  Journal of Global Optimization, 1994
• On-line and off-line vertex enumeration by adjacency lists
  Operations Research Letters, 1991
• A finite cutting plane method for solving linear programs with an additional reverse convex constraint
  European Journal of Operational Research, 1990
• Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and D.C. Optimization problems
  Mathematical Programming, 1988
• On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
  Operations Research Letters, 1988
• A modified version of Tuy's method for solving d.c. programing problem
  Optimization, 1988
• Convex programs with an additional reverse convex constraint
  Journal of Optimization Theory and Applications, 1987
• A method for globally minimizing concave functions over convex sets
  Mathematical Programming, 1981
• Reverse convex programming
  Applied Mathematics & Optimization, 1980
• Newton's method for convex programming and Tchebycheff approximation
  Numerische Mathematik, 1959