AN OUTER APPROXIMATION METHOD UTILIZING THE RELATION OF CONNECTIONS AMONG VERTICES FOR SOLVING A DC PROGRAMMING PROBLEM
In this paper, we improve the outer approximation method proposed by Tuy  for solving a dc programming problem. The improved algorithm has the global convergence by generating a sequence of polytopes approximating a compact convex set from outside. Moreover, by incorporating a procedure for calculating the vertex sets utilizing the relations of connections among vertices by edges, the improved algorithm can calculate an approximate solution effectively.
How to Cite
Copyright (c) 2010 Journal of Nonlinear Analysis and Optimization: Theory & Applications
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.