On the effectiveness of Lagrangean cuts in solving a class of low rank d.c. programs

References

• I. Bomze, M. Locatelli, (2004): Undominated d.c. Decompositions of Quadratic Functions and Applications to Branch-and-Bound Approaches, Computational Optimization and Applications, 28, 227–245 doi: 10.1023/B:COAP.0000026886.61324.e4
   Web of Science ®Google Scholar
• R. Cambini, F. Salvi, (2010): Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience, Operations Research Letters, 38 (5), 354–357 doi: 10.1016/j.orl.2010.07.008
   Web of Science ®Google Scholar
• R. Cambini, F. Salvi, (2009): A branch and reduce approach for solving a class of low rank d.c. programs, Journal of Computational and Applied Mathematics, 233, 492–501 doi: 10.1016/j.cam.2009.07.053
   Web of Science ®Google Scholar
• R. Cambini, C. Sodini, (2002): A finite algorithm for a particular d.c. quadratic programming problem, Annals of Operations Research, 117, 33–49 doi: 10.1023/A:1021509220392
   Web of Science ®Google Scholar
• R. Cambini, C. Sodini, (2005): Decomposition methods for solving nonconvex quadratic programs via branch and bound, Journal of Global Optimization, 33, 313–336 doi: 10.1007/s10898-004-6095-8
   Web of Science ®Google Scholar
• R. Cambini, C. Sodini, (2008): A computational comparison of some branch and bound methods for indefinite quadratic programs, Central European Journal of Operations Research, 16, 139–152 doi: 10.1007/s10100-007-0049-4
   Web of Science ®Google Scholar
• J. E. Falk, R. M. Soland, (1969): An algorithm for separable nonconvex programming problems, Management Science, 15, 550–569 doi: 10.1287/mnsc.15.9.550
   Web of Science ®Google Scholar
• C.A. Floudas, P. M. Pardalos, (1999): Handbook of Test Problems in Local and Global Optimization, Nonconvex Optimization and Its Applications, vol. 33, Springer Berlin
   Google Scholar
• X. Honggang, X. Chengxian, (2005): A branch and bound algorithm for solving a class of D-C programming Applied Mathematics and Computation, 165, 29–302
   Google Scholar
• R. Horst, P. M. Pardalos, (1995): Handbook of Global Optimization, Nonconvex Optimization and Its Applications, vol. 2, Kluwer Academic Publishers, Dordrecht
   Google Scholar
• R. Horst, N. V. Thoai, (1999): D.C. programming: Overview, Journal of Optimization Theory and Applications, 103, 1–43 doi: 10.1023/A:1021765131316
   Web of Science ®Google Scholar
• R. Horst, H. Tuy, (1990): Global optimization deterministic approaches, Springer-Verlag
   Google Scholar
• F. A. A. Khayyal, H. D. Sherali, (2000): On finitely terminating branch and bound algorithms for some global optimization problems, SIAM Journal Optimization, 10, 1049–1057 doi: 10.1137/S105262349935178X
   Web of Science ®Google Scholar
• H. Konno, P.T. Thach, H. Tuy, (1997): Optimization on low rank non-convex structures, Nonconvex Optimization and Its Applications, vol. 15, Kluwer Academic Publishers, Dordrecht
   Google Scholar
• H. Konno, A. Wijayanayake, (2002): Portfolio optimization under d.c. transaction costs and minimal transaction unit constraints, Journal of Global Optimization, 22, 137–154 doi: 10.1023/A:1013850928936
   Web of Science ®Google Scholar
• M. Minoux, (1986): Mathematical Programming Theory and Algorithms, Wiley-Intersciences Publication
   Google Scholar
• J. Parker, N. V. Sahinidis, (1998): A Finite Algorithm for Global Minimization of Separable Concave Programs, Journal of Global Optimization, 12, 1–36 doi: 10.1023/A:1008241411395
   Web of Science ®Google Scholar
• T.Q. Phong, L.T. Hoai An, P.D. Tao, (1995): Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems, Operations Research Letters, 17, 215–220 doi: 10.1016/0167-6377(95)00014-B
   Web of Science ®Google Scholar
• R.T. Rockafellar, (1972): Convex Analysis, Princeton University Press, second edition
   Google Scholar
• H.S. Ryoo, N. V. Sahinidis, (1996): A branch-and-reduce approach to global optimization, Journal of Global Optimization, 8, 107–138 doi: 10.1007/BF00138689
   Web of Science ®Google Scholar
• H.S. Ryoo, N. V. Sahinidis, (2003): Global optimization of multiplicative programs, Journal of Global Optimization, 26, 387–418 doi: 10.1023/A:1024700901538
   Web of Science ®Google Scholar
• H. Tuy, (1996): A general d.c. approach to location problems, State of the art in global optimization, edited by C.A. Floudas, P. M. Pardalos, Nonconvex Optimization and Its Applications, vol. 7, pp. 413–432, Kluwer Academic Publishers, Dordrecht
   Google Scholar
• H. Tuy, (1998): Convex Analysis and Global Optimization, Nonconvex Optimization and its Applications, vol. 22, Kluwer Academic Publishers, Dordrecht
   Google Scholar