AN OUTER APPROXIMATION METHOD UTILIZING THE RELATION OF CONNECTIONS AMONG VERTICES FOR SOLVING A DC PROGRAMMING PROBLEM

Authors

  • S. Yamada Graduate School of Science and Technology, Niigata University, 8050 Ikarashi-2nocho, Niigata-City 950-2181, Japan
  • Y. Tokushige Graduate School of Science and Technology, Niigata University, 8050 Ikarashi-2nocho, Niigata-City 950-2181, Japan
  • T. Tanaka Graduate School of Science and Technology, Niigata University, 8050 Ikarashi-2nocho, Niigata-City 950-2181, Japan
  • T. Tanino Graduate School of Engineering, Osaka University, Yamada-Oka 2-1, Suita, Osaka, 565-0871, Japan

Abstract

In this paper, we improve the outer approximation method proposed by Tuy [10] 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.

Downloads

Published

2012-03-31

How to Cite

Yamada, S., Tokushige, Y., Tanaka, T., & Tanino, T. (2012). AN OUTER APPROXIMATION METHOD UTILIZING THE RELATION OF CONNECTIONS AMONG VERTICES FOR SOLVING A DC PROGRAMMING PROBLEM. Journal of Nonlinear Analysis and Optimization: Theory & Applications, 3(1), 1-12. Retrieved from http://www.math.sci.nu.ac.th/ojs302/index.php/jnao/article/view/71

Issue

Section

Research Article