Name
Abstract | ||
|---|---|---|
This paper discusses computational complexity of conceptual successive convex relaxation methods proposed by Kojima and Tun脙§el for approximating a convex relaxation of a compact subsetof the n-dimensional Euclidean spaceR n . Here,C0 denotes a nonempty compact convex subset ofR n , anda set of finitely or infinitely many quadratic functions. We evaluate the number of iterations which the successive convex relaxation methods require to attain a convex relaxation ofF with a given accuracy e, in terms of e, the diameter ofC0, the diameter ofF, and some other quantities characterizing the Lipschitz continuity, the nonlinearity, and the nonconvexity of the setof quadratic functions. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1287/moor.26.3.519.10580 | Math. Oper. Res. |
Keywords | DocType | Volume |
convex relaxation,conceptual successive convex relaxation,nonempty compact convex subset,successive convex relaxation method,compact subsetof,diameter ofC0,ofR n,quadratic function,setof quadratic function,C0 denotes,Complexity Analysis,Nonconvex Sets,Successive Convex Relaxation Methods | Journal | 26 |
Issue | ISSN | Citations |
3 | 0364-765X | 2 |
PageRank | References | Authors |
0.54 | 8 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Masakazu Kojima | 1 | 1603 | 222.51 |
| Akiko Takeda | 2 | 2 | 1.21 |