메뉴 건너뛰기




Volumn 33, Issue 3, 2005, Pages 313-336

Decomposition methods for solving nonconvex quadratic programs via branch and bound

Author keywords

Branch and bound; d.c. Decomposition; Quadratic programming

Indexed keywords

ALGORITHMS; DECOMPOSITION; FUNCTIONS; PROBLEM SOLVING;

EID: 27844435373     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-004-6095-8     Document Type: Article
Times cited : (32)

References (25)
  • 1
    • 0242356173 scopus 로고    scopus 로고
    • An algorithm for global minimization of linearly constrained quadratic functions
    • Barrientos, O. and Correa, R. (2000), An algorithm for global minimization of linearly constrained quadratic functions, Journal of Global Optimization 16, 77-93.
    • (2000) Journal of Global Optimization , vol.16 , pp. 77-93
    • Barrientos, O.1    Correa, R.2
  • 2
    • 0346760603 scopus 로고    scopus 로고
    • Global and local quadratic minimization
    • Best, M.J. and Ding, B. (1997), Global and local quadratic minimization", Journal of Global Optimization 10, 77-90.
    • (1997) Journal of Global Optimization , vol.10 , pp. 77-90
    • Best, M.J.1    Ding, B.2
  • 3
    • 0347372731 scopus 로고    scopus 로고
    • A decomposition method for global and local quadratic minimization
    • Best, M.J. and Ding, B. (2000), A decomposition method for global and local quadratic minimization, Journal of Global Optimization 16, 133-151.
    • (2000) Journal of Global Optimization , vol.16 , pp. 133-151
    • Best, M.J.1    Ding, B.2
  • 4
    • 0040661453 scopus 로고
    • A finite algorithm for solving general quadratic problems
    • Bomze, I.M. and Danninger, G. (1994), A finite algorithm for solving general quadratic problems, Journal of Global Optimization 4, 1-16.
    • (1994) Journal of Global Optimization , vol.4 , pp. 1-16
    • Bomze, I.M.1    Danninger, G.2
  • 5
    • 0036958993 scopus 로고    scopus 로고
    • A finite algorithm for particular d.c. quadratic programming problem
    • Cambini, R. and Sodini, C. (2002), A finite algorithm for particular d.c. quadratic programming problem, Annals of Operations Research 117, 33-49.
    • (2002) Annals of Operations Research , vol.117 , pp. 33-49
    • Cambini, R.1    Sodini, C.2
  • 6
    • 1642448331 scopus 로고    scopus 로고
    • A concave composite programming perspective on D.C. programming
    • Eberhard, A., Hill, R., Ralph, D. and Glover, B.M. (eds), Kluwer Academic Publishers, Dordrecht
    • Churilov, L. and Sniedovich, M. (1999), A concave composite programming perspective on D.C. programming. In: Eberhard, A., Hill, R., Ralph, D. and Glover, B.M. (eds), Progress in Optimization Applied Optimization, Vol. 30, Kluwer Academic Publishers, Dordrecht.
    • (1999) Progress in Optimization Applied Optimization , vol.30
    • Churilov, L.1    Sniedovich, M.2
  • 7
    • 0347390883 scopus 로고    scopus 로고
    • Quadratic programming with box constraints
    • Bomze I.M., et. al. (eds), Kluwer Academic Publishers, Dordrecht
    • De Angelis, P.L., Pardalos, P.M. and Toraldo, G. (1997), Quadratic Programming with Box Constraints. In: Bomze I.M., et. al. (eds), Developments in Global Optimization, Kluwer Academic Publishers, Dordrecht, pp. 73-93.
    • (1997) Developments in Global Optimization , pp. 73-93
    • De Angelis, P.L.1    Pardalos, P.M.2    Toraldo, G.3
  • 9
    • 0001423319 scopus 로고
    • An algorithm for separable nonconvex programming problems
    • Falk, J.E. and Soland, R.M. (1969), An algorithm for separable nonconvex programming problems, Management Science 15(9), 550-569.
    • (1969) Management Science , vol.15 , Issue.9 , pp. 550-569
    • Falk, J.E.1    Soland, R.M.2
  • 10
    • 0004131235 scopus 로고
    • Chelsea Publishing Company, New York
    • Gantmacher, F.R. (1960), The Theory of Matrices, Vol. 1, Chelsea Publishing Company, New York.
    • (1960) The Theory of Matrices , vol.1
    • Gantmacher, F.R.1
  • 11
    • 0001780949 scopus 로고
    • Generalized differentiability, duality and optimization for problems dealing with differences of convex functions
    • Lecture Notes in Economics and Mathematical Systems, Springer-Verlag
    • Hiriart-Urruty, J.B. (1985), Generalized differentiability, duality and optimization for problems dealing with differences of convex functions. In: Convexity and Duality in Optimization, Lecture Notes in Economics and Mathematical Systems, Vol. 256, Springer-Verlag.
    • (1985) Convexity and Duality in Optimization , vol.256
    • Hiriart-Urruty, J.B.1
  • 12
    • 34250387491 scopus 로고
    • An algorithm for nonconvex programming problems
    • Horst, R. (1976), An algorithm for nonconvex programming problems, Mathematical Programming 10(3), 312-321.
    • (1976) Mathematical Programming , vol.10 , Issue.3 , pp. 312-321
    • Horst, R.1
  • 13
    • 5244328334 scopus 로고
    • A note on the convergence of an algorithm for nonconvex programming problems
    • Horst, R. (1980), A note on the convergence of an algorithm for nonconvex programming problems, Mathematical Programming 19(2), 237-238.
    • (1980) Mathematical Programming , vol.19 , Issue.2 , pp. 237-238
    • Horst, R.1
  • 16
    • 0029776534 scopus 로고    scopus 로고
    • A new algorithm for solving the general quadratic programming problem
    • Horst, R. and Nguyen Van Thoai. (1996), A new algorithm for solving the general quadratic programming problem, Computational Optimization and Applications 5(1), 39-48.
    • (1996) Computational Optimization and Applications , vol.5 , Issue.1 , pp. 39-48
    • Horst, R.1    Nguyen Van Thoai2
  • 17
    • 34250388607 scopus 로고
    • Maximization of a convex quadratic function under linear constraints
    • Konno, H. (1976), Maximization of a convex quadratic function under linear constraints, Mathematical Programming 11(2), 117-127.
    • (1976) Mathematical Programming , vol.11 , Issue.2 , pp. 117-127
    • Konno, H.1
  • 18
    • 0001445010 scopus 로고    scopus 로고
    • Solving a class of linearly constrained indefinite quadratic problems by D.C. algorithms
    • Le Thi Hoai An and Pham Dinh Tao. (1997), Solving a class of linearly constrained indefinite quadratic problems by D.C. algorithms, Journal of Global Optimization 11, 253-285.
    • (1997) Journal of Global Optimization , vol.11 , pp. 253-285
    • An, L.T.H.1    Pham Dinh Tao2
  • 19
    • 2342574630 scopus 로고
    • An algorithm for indefinite quadratic programming with convex constraints
    • Muu, L.D. and Oettli, W. (1991), An algorithm for indefinite quadratic programming with convex constraints, Operations Research Letters 10(6), 323-327.
    • (1991) Operations Research Letters , vol.10 , Issue.6 , pp. 323-327
    • Muu, L.D.1    Oettli, W.2
  • 20
    • 0023541769 scopus 로고
    • Global minimization of indefinite quadratic problems
    • Pardalos, P.M., Glick, J.H. and Rosen, J.B. (1987), Global minimization of indefinite quadratic problems, Computing 39(4), 281-291.
    • (1987) Computing , vol.39 , Issue.4 , pp. 281-291
    • Pardalos, P.M.1    Glick, J.H.2    Rosen, J.B.3
  • 21
    • 2242460480 scopus 로고
    • Global optimization algorithms for linearly constrained indefinite quadratic problems
    • Pardalos, P.M. (1991), Global optimization algorithms for linearly constrained indefinite quadratic problems, Computers and Mathematics with Applications 21, 87-97.
    • (1991) Computers and Mathematics with Applications , vol.21 , pp. 87-97
    • Pardalos, P.M.1
  • 22
    • 0029313349 scopus 로고
    • Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems
    • Phong Thai Quynh, An Le Thi Hoai and Tao Pham Dinh. (1995), Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems, Operations Research Letters, 17(5), 215-220.
    • (1995) Operations Research Letters , vol.17 , Issue.5 , pp. 215-220
    • Phong Thai Quynh1    Hoai, A.L.T.2    Tao Pham Dinh3
  • 23
    • 0022677990 scopus 로고
    • Global minimization of large scale constrained concave quadratic problems by separable programming
    • Rosen, J.B. and Pardalos, P.M. (1986), Global minimization of large scale constrained concave quadratic problems by separable programming, Mathematical Programming 34, 163-174.
    • (1986) Mathematical Programming , vol.34 , pp. 163-174
    • Rosen, J.B.1    Pardalos, P.M.2
  • 24
    • 0002911084 scopus 로고
    • D.C. optimization: Theory, methods and algorithms
    • Horst R., and Pardalos, P.M. (eds.), Kluwer Academic Publishers, Dordrecht
    • Tuy, H. (1995), D.C. optimization: theory, methods and algorithms, In: Horst R., and Pardalos, P.M. (eds.), Handbook of Global Optimization, Nonconvex Optimization and Its Applications, Vol. 2, Kluwer Academic Publishers, Dordrecht, pp. 149-216.
    • (1995) Handbook of Global Optimization, Nonconvex Optimization and Its Applications , vol.2 , pp. 149-216
    • Tuy, H.1
  • 25
    • 27844605314 scopus 로고    scopus 로고
    • Convex analysis and global optimization
    • Kluwer Academic Publishers, Dordrecht
    • Tuy, H. (1998) Convex analysis and global optimization, Nonconvex Optimization and Its Applications, Vol. 22, Kluwer Academic Publishers, Dordrecht.
    • (1998) Nonconvex Optimization and Its Applications , vol.22
    • Tuy, H.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.