Abstract
We give necessary and sufficient Global Optimality Conditions for d.c. (difference of two convex functions) minimization problem and further development of a global search algorithm based on the theory. Finally we test the proposed algorithm on a concret problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Horst R., Tuy H. (1993), Global Optimization Deterministic Approaches, 2nd revised edition, Springer Verlag, Heidelberg.
Horst R., Pardalos P.M., Thoai N. (1995), Introduction to Global Optimization, Kluwer Academic Publishers, Dordrecht/Boston/London.
Floudas, C.A., Pardalos, P.M. (1990), A Collection of Test Problems for Constrained Global Optimization Algorithms, Lecture Notes in Computer Science, 455, Springer Verlag, Berlin.
Hiriart-Urruty J.B. (1989), From convex optimization to nonconvex optimization. Part I: Necessary and sufficient conditions for optimality, in Nonsmooth Optimization and related topics, Plenum Press, 219–239.
Bazaraa M.S., Shetty S.M. (1979), Nonlinear Programming Theory and Algorithms, J.Wiley and Sons, New York.
Strekalovsky A.S. (1997), On Global Optimality Conditions for D.C. Programming Problems, seria “Optimization and Optimal Control”, Irkutsk State University Press, Irkutsk.
Strekalovsky A.S., Tsevendorj I. (1998), “Testing the R—strategy for a Reverse Convex Problem,” Journal of Global Optimization, vol. 13, 61–74.
Strekalovsky A.S. (1993), “ On Search of global maximum of a convex function. over a feasible set,” Journal of Computational Mathematics and Mathematical Physics, vol. 33, 349–364.
Kuznetsova A.A., Strekalovsky A.S., Tsevendorj I. (1999), “ On an approach to solve integer programming problems,” Journal of Computational Mathematics and Mathematical Physics, vol. 39, 9–16.
Polak E. (1971), Computational methods in optimization. An unified approach. Academic Press, New York/London.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Strekalovsky, A.S. (2000). One way to Construct a Global Search Algorithm for d.c. Minimization Problems. In: Pillo, G.D., Giannessi, F. (eds) Nonlinear Optimization and Related Topics. Applied Optimization, vol 36. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3226-9_23
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3226-9_23
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4823-6
Online ISBN: 978-1-4757-3226-9
eBook Packages: Springer Book Archive