Name
Title | ||
|---|---|---|
Parallel Implementation of Successive Convex Relaxation Methods for Quadratic Optimization Problems |
Abstract | ||
|---|---|---|
As computing resources continue to improve, global solutions for larger size quadrically constrained optimization problems become more achievable. In this paper, we focus on larger size problems and get accurate bounds for optimal values of such problems with the successive use of SDP relaxations on a parallel computing system called Ninf (Network-based Information Library for high performance computing). |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1023/A:1020299805773 | Journal of Global Optimization |
Keywords | Field | DocType |
Nonconvex quadratic program,SDP relaxation,Lift-and-project LP relaxation,Lift-and-project procedure,Parallel computation,Global computing | Mathematical optimization,Quadratically constrained quadratic program,Supercomputer,Constrained optimization problem,Quadratic programming,Lagrangian relaxation,Convex relaxation,Mathematics | Journal |
Volume | Issue | ISSN |
24 | 2 | 1573-2916 |
Citations | PageRank | References |
2 | 0.41 | 19 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Akiko Takeda | 1 | 196 | 29.72 |
| Katsuki Fujisawa | 2 | 248 | 28.63 |
| Yusuke Fukaya | 3 | 2 | 0.41 |
| Masakazu Kojima | 4 | 1603 | 222.51 |