Abstract
In this paper a particular quadratic minimum program, having a particular d.c. objective function, is studied. Some theoretical properties of the problem are stated and the existence of minimizers is characterized. A solution algorithm, based on the so called “optimal level solutions” approach, is finally proposed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. Auslender, Noncoercive optimization problems, Mathematics of Operations Research 21(4) (1996) 769–782.
A. Auslender, How to deal with the unbounded in optimization: theory and algorithms, Mathematical Programming 79 (1997) 3–18.
A. Auslender, Existence of optimal solutions and duality results under weak conditions, Mathematical Programming 88 (2000) 45–59.
I.M. Bomze and G. Danninger, A finite algorithm for solving general quadratic problems, Journal of Global Optimization 4 (1994) 1–16.
R. Cambini, A class of non-linear programs: theoretical and algorithmic results, in: Generalized Convexity, eds. S. Komlósi, T. Rapcsák and S. Schaible, Lecture Notes in Economics and Mathematical Systems, Vol. 405 (Springer, Berlin, 1994) pp. 294–310.
R. Cambini and L. Carosi, Coercivity concepts and recession function in constrained problems, Report No. 185, Department of Statistics and Applied Mathematics, University of Pisa (2000).
L. Churilov and M. Sniedovich, A concave composite programming perspective on D.C. programming, in: Progress in Optimization, eds. A. Eberhard, R. Hill, D. Ralph and B.M. Glover, Applied Optimization, Vol. 30 (Kluwer Academic, Dordrecht, 1999).
G. Danninger, Role of copositivity in optimality criteria for nonconvex optimization problems, Journal of Optimization Theory and Applications 75 (1992) 535–558.
P.L. De Angelis, P.M. Pardalos and G. Toraldo, Quadratic programming with box constraints, in: Developments in Global Optimization, eds. I.M. Bomze et al. (Kluwer Academic, Dordrecht, 1997) pp. 73–93.
A. Ellero, The optimal level solutions method, Journal of Information & Optimization Sciences 17(2) (1996) 355–372.
F.R. Gantmacher, The Theory of Matrices, Vol. 1 (Chelsea, New York, 1960).
R. Horst, P.M. Pardalos and N.V. Thoai, Introduction to Global Optimization, Nonconvex Optimization and Its Applications, Vol. 3 (Kluwer Academic, Dordrecht, 1995).
R. Horst and H. Tuy, Global Optimization (Springer, Berlin, 1990).
H. Konno, P.T. Thach and H. Tuy, Optimization on Low Rank Nonconvex Structures, Nonconvex Optimization and Its Applications, Vol. 15 (Kluwer Academic, Dordrecht, 1997).
R.T. Rockafellar, Convex Analysis (Princeton University Press, Princeton, NJ, 1970).
S. Schaible and C. Sodini, A finite algorithm for generalized linear multiplicative programming, Journal of Optimization Theory and Applications 87(2) (1995) 441–455.
H. Tuy, D.C. optimization: theory, methods and algorithms, in: Handbook of Global Optimization, eds. R. Horst and P.M. Pardalos, Nonconvex Optimization and Its Applications, Vol. 2 (Kluwer Academic, Dordrecht, 1995) pp. 149–216.
H. Tuy, Convex Analysis and Global Optimization, Nonconvex Optimization and Its Applications, Vol. 22 (Kluwer Academic, Dordrecht, 1998).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Cambini, R., Sodini, C. A Finite Algorithm for a Particular D.C. Quadratic Programming Problem. Annals of Operations Research 117, 33–49 (2002). https://doi.org/10.1023/A:1021509220392
Issue Date:
DOI: https://doi.org/10.1023/A:1021509220392