Second order cone programming relaxation of nonconvex quadratic optimization problems

被引：0
|
作者：
Kim, Sunyoung [1 ]
Kojima, Masakazu [2 ]
机构：
[1] Department of Mathematics, Ewha Women's University, 11-1 Dahyun-dong, Sudaemoon-gu, Seoul 120-750, Korea, Republic of
[2] Dept. of Math. and Comp. Sciences, Tokyo Institute of Technology, 2-12-1 Oh-Okayama, Meguro-ku, Tokyo 152-8552, Japan
来源：
Optimization Methods and Software | 2002年 / 15卷 / 3-4期
关键词：
Keywords: Second-order-cone program; Lift-and-project convex relaxation method; Nonconvex quadratic program; Global optimization; Primal-dual interior-point method *Corresponding author. E-mail: skim@mm.ewha.ac.kr; skim@is.titech.ac.jp This work was conducted while this author has been visiting - Tokyo Institute of Technology; Department of Mathematical and Computing Sciences; on a sabbatical leave from Ewha Women's University; Korea. Research of this author was s u ~ ~ o r t eind part by KOSEF 97-01-01-01-3 and rain Korea 21. $E-mail: kojima@is.titech.ac.jp;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
22
引用
收藏
页码：201 / 224
相关论文
共 50 条
  • [31] Multi-Standard Quadratic Optimization: interior point methods and cone programming reformulation
    Immanuel M. Bomze
    Werner Schachinger
    Computational Optimization and Applications, 2010, 45 : 237 - 256
  • [32] Copositive relaxation for general quadratic programming
    Quist, AJ
    De Klerk, E
    Roos, C
    Terlaky, T
    OPTIMIZATION METHODS & SOFTWARE, 1998, 9 (1-3) : 185 - 208
  • [33] Multi-Standard Quadratic Optimization: interior point methods and cone programming reformulation
    Bomze, Immanuel M.
    Schachinger, Werner
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2010, 45 (02) : 237 - 256
  • [34] Solution to nonconvex quadratic programming with both inequality and box constraints
    Xi Zhang
    Jinghao Zhu
    David Y. Gao
    Optimization and Engineering, 2009, 10 : 183 - 191
  • [35] Solution to nonconvex quadratic programming with both inequality and box constraints
    Zhang, Xi
    Zhu, Jinghao
    Gao, David Y.
    OPTIMIZATION AND ENGINEERING, 2009, 10 (02) : 183 - 191
  • [36] Parallel Implementation of Successive Convex Relaxation Methods for Quadratic Optimization Problems
    Akiko Takeda
    Katsuki Fujisawa
    Yusuke Fukaya
    Masakazu Kojima
    Journal of Global Optimization, 2002, 24 : 237 - 260
  • [37] A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
    Audet, C
    Hansen, P
    Jaumard, B
    Savard, G
    MATHEMATICAL PROGRAMMING, 2000, 87 (01) : 131 - 152
  • [38] Parallel implementation of successive convex relaxation methods for quadratic optimization problems
    Takeda, A
    Fujisawa, K
    Fukaya, Y
    Kojima, M
    JOURNAL OF GLOBAL OPTIMIZATION, 2002, 24 (02) : 237 - 260
  • [39] Canonical Duality Theory and Solutions to Constrained Nonconvex Quadratic Programming
    David Yang Gao
    Journal of Global Optimization, 2004, 29 : 377 - 399
  • [40] First-Order Methods for Nonconvex Quadratic Minimization
    Carmon, Yair
    Duchi, John C.
    SIAM REVIEW, 2020, 62 (02) : 395 - 436
12345