메뉴 건너뛰기
Mathematical Programming, Series B
Volumn 87, Issue 3, 2000, Pages 453-465
Quadratic maximization and semidefinite relaxation
Author keywords

Approximation; Polynomial time algorithm; Quadratic programming; Semidefinite programming relaxation
Indexed keywords

EID: 0038029207     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070050006     Document Type: Article
Times cited : (149)
References (12)
  • 1
    • 0003169116 scopus 로고
    • Interior point methods in semidefinite programming with applications to combinatorial optimization
    • Alizedeh, F. (1995): Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM J. Optim. 5, 13-51
    • (1995) SIAM J. Optim. , vol.5 , pp. 13-51
    • Alizedeh, F.1
  • 2
    • 0005325563 scopus 로고    scopus 로고
    • Semidefinite relaxations, multivariate normal distributions, and order statistics
    • Du, D.-Z., Pardalos, P.M., eds., Kluwer Academic Publishers
    • Bertsimas, D., Ye, Y. (1998): Semidefinite relaxations, multivariate normal distributions, and order statistics. In: Du, D.-Z., Pardalos, P.M., eds., Handbook of Combinatorial Optimization 3, pp. 1-19. Kluwer Academic Publishers
    • (1998) Handbook of Combinatorial Optimization , vol.3 , pp. 1-19
    • Bertsimas, D.1    Ye, Y.2
  • 3
    • 0000457427 scopus 로고    scopus 로고
    • Semidefinite programming in combinatorial optimization
    • Goemans, M.X. (1997): Semidefinite programming in combinatorial optimization. Math. Program. 79, 143-161
    • (1997) Math. Program. , vol.79 , pp. 143-161
    • Goemans, M.X.1
  • 4
    • 84893574327 scopus 로고
    • Improved approximation algorithms for maximum cut and satisfiability problems using semi-definite programming
    • Goemans, M.X., Williamson, D.P. (1995): Improved approximation algorithms for maximum cut and satisfiability problems using semi-definite programming. J. ACM 42, 1115-1145
    • (1995) J. ACM , vol.42 , pp. 1115-1145
    • Goemans, M.X.1    Williamson, D.P.2
  • 6
    • 0000467513 scopus 로고    scopus 로고
    • On maximization of quadratic form over intersection of ellipsoids with common center
    • Nemirovski, A., Roos, C., Terlaky, T. (1999): On maximization of quadratic form over intersection of ellipsoids with common center. Math. Program. 86, 463-173
    • (1999) Math. Program. , vol.86 , pp. 463-1173
    • Nemirovski, A.1    Roos, C.2    Terlaky, T.3
  • 7
    • 0010165017 scopus 로고    scopus 로고
    • Semidefinite relaxation and nonconvex quadratic optimization
    • Nesterov, Yu. (1997): Semidefinite relaxation and nonconvex quadratic optimization. Optim. Methods Software 12, 1-20
    • (1997) Optim. Methods Software , vol.12 , pp. 1-20
    • Nesterov, Yu.1
  • 10
    • 0030106462 scopus 로고    scopus 로고
    • Semidefinite programming
    • Vandenberghe, L., Boyd, S. (1996): Semidefinite programming. SIAM Rev. 38, 49-95
    • (1996) SIAM Rev. , vol.38 , pp. 49-95
    • Vandenberghe, L.1    Boyd, S.2
  • 11
    • 0000549997 scopus 로고    scopus 로고
    • Approximating quadratic programming with bound and quadratic constraints
    • Ye, Y. (1999): Approximating quadratic programming with bound and quadratic constraints. Math. Program. 84, 219-226
    • (1999) Math. Program. , vol.84 , pp. 219-226
    • Ye, Y.1
  • 12
    • 0038485120 scopus 로고    scopus 로고
    • Approximating global quadratic optimization with convex quadratic constraints
    • Ye, Y. (1999): Approximating global quadratic optimization with convex quadratic constraints. J. Glob. Optim. 15, 1-17
    • (1999) J. Glob. Optim. , vol.15 , pp. 1-17
    • Ye, Y.1

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