Abstract
We consider the following global optimization problem
where Ω is a closed convex set in Rn and all functions f 0 ,g i are d.c. Here, d.c. stand for “difference of two convex functions”. For detail discussion on d.c. functions and d.c. programming, we refer to the excellent monograph “Global Optimization” by R.Horst and H.Tuy.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Physica-Verlag Heidelberg
About this paper
Cite this paper
Thai, P.Q. (1992). A New Method for Solving General D.C. Programs and Application to System of Quadratic Equations. In: Gritzmann, P., Hettich, R., Horst, R., Sachs, E. (eds) Operations Research ’91. Physica-Verlag HD. https://doi.org/10.1007/978-3-642-48417-9_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-48417-9_33
Publisher Name: Physica-Verlag HD
Print ISBN: 978-3-7908-0608-3
Online ISBN: 978-3-642-48417-9
eBook Packages: Springer Book Archive