Parallel Implementation of Successive Convex Relaxation Methods for Quadratic Optimization Problems

被引：0
|
作者：
Akiko Takeda
Katsuki Fujisawa
Yusuke Fukaya
Masakazu Kojima
机构：
[1] Toshiba Corporation,Department of Architecture
[2] Kyoto University,Department of Mathematical and Computing Sciences
[3] NS Solutions Corporation,undefined
[4] Tokyo Institute of Technology,undefined
来源：
Journal of Global Optimization | 2002年 / 24卷
关键词：
Nonconvex quadratic program; SDP relaxation; Lift-and-project LP relaxation; Lift-and-project procedure; Parallel computation; Global computing;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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).
引用
收藏
页码：237 / 260
页数：23
相关论文
共 50 条
  • [21] Complexity analysis of successive convex relaxation methods for nonconvex sets
    Kojima, M
    Takeda, A
    MATHEMATICS OF OPERATIONS RESEARCH, 2001, 26 (03) : 519 - 542
  • [22] Stochastic Successive Convex Approximation for General Stochastic Optimization Problems
    Ye, Chencheng
    Cui, Ying
    IEEE WIRELESS COMMUNICATIONS LETTERS, 2020, 9 (06) : 755 - 759
  • [23] DC approach to weakly convex optimization and nonconvex quadratic optimization problems
    Nguyen, Linh T. H.
    OPTIMIZATION, 2018, 67 (02) : 195 - 216
  • [24] REDUCED SUCCESSIVE QUADRATIC-PROGRAMMING IMPLEMENTATION FOR LARGE-SCALE OPTIMIZATION PROBLEMS WITH SMALLER DEGREES OF FREEDOM
    VASANTHARAJAN, S
    VISWANATHAN, J
    BIEGLER, LT
    COMPUTERS & CHEMICAL ENGINEERING, 1990, 14 (08) : 907 - 915
  • [25] Tightening a copositive relaxation for standard quadratic optimization problems
    Xia, Yong
    Sheu, Ruey-Lin
    Sun, Xiaoling
    Li, Duan
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2013, 55 (02) : 379 - 398
  • [26] Tightening a copositive relaxation for standard quadratic optimization problems
    Yong Xia
    Ruey-Lin Sheu
    Xiaoling Sun
    Duan Li
    Computational Optimization and Applications, 2013, 55 : 379 - 398
  • [27] A parallel quadratic programming method for dynamic optimization problems
    Frasch, Janick V.
    Sager, Sebastian
    Diehl, Moritz
    MATHEMATICAL PROGRAMMING COMPUTATION, 2015, 7 (03) : 289 - 329
  • [28] Universal gradient methods for convex optimization problems
    Yu Nesterov
    Mathematical Programming, 2015, 152 : 381 - 404
  • [29] Regularized optimization methods for convex MINLP problems
    de Oliveira, Welington
    TOP, 2016, 24 (03) : 665 - 692
  • [30] Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints
    Xinzhen Zhang
    Chen Ling
    Liqun Qi
    Journal of Global Optimization, 2011, 49 : 293 - 311
12345