Proceedings of the Annual Conference of the Institute of Systems, Control and Information Engineers
The 51st Annual Conference of the Institute of Systems, Control and Information Engineers
Session ID : 1F1-4
Conference information

Host: The Institute of Systems, Control and Information Engineers

A successive approximation method using a quadratic approximation for a global optimization problem
*Syuuji Yamada, Tamaki Tanaka, Tetsuzo Tanino
Author information
Keywords: Outer approximation method, D.C. programming problem, Quadratic approximation
CONFERENCE PROCEEDINGS FREE ACCESS

Details
Download citation RIS

(compatible with EndNote, Reference Manager, ProCite, RefWorks)

BIB TEX

(compatible with BibDesk, LaTeX)

Text
How to download citation
Contact us
Abstract
In this study, we propose an outer approximation method for a global optimization problem constrained by convex and concave functions. It is known that such a problem can be transformed into a d.c. programming problem. The proposed algorithm utilizes a sequence of convex polyhedral sets approximating the reverse convex set.
Content from these authors
© 2007 The Institute of Systems, Control and Information Engineers
Previous article Next article
Favorites & Alerts

Recently viewed articles
Share this page
feedback
 Top