SECOND ORDER OPTIMALITY CONDITIONS AND REFORMULATIONS FOR NONCONVEX QUADRATICALLY CONSTRAINED QUADRATIC PROGRAMMING PROBLEMS

被引:3
|
作者
Shi, Ziye [1 ]
Jin, Qingwei [2 ]
机构
[1] Tsinghua Univ, Dept Math Sci, Beijing 100084, Peoples R China
[2] Zhejiang Univ, Dept Management Sci & Engn, Hangzhou 310058, Zhejiang, Peoples R China
关键词
Quadratic programming; optimality condition; algorithm; copositive programming; OPTIMIZATION; MINIMIZATION; CONES;
D O I
10.3934/jimo.2014.10.871
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In this paper, we present an optimality condition which could determine whether a given KKT solution is globally optimal. This condition is equivalent to determining if the Hessian of the corresponding Largrangian is copositive over a set. To find the corresponding Lagrangian multiplier, two linear conic programming problems are constructed and then relaxed for computational purpose. Under the new condition, we proposed a local search based scheme to find a global optimal solution and showed its effectiveness by three examples.
引用
收藏
页码:871 / 882
页数:12
相关论文
共 50 条
  • [41] Global optimality conditions for nonconvex minimization problems with quadratic constraints
    Guoquan Li
    Zhiyou Wu
    Jing Quan
    [J]. Journal of Inequalities and Applications, 2015
  • [42] Reinforcement Learning-Guided Quadratically Constrained Quadratic Programming for Enhanced Convergence and Optimality
    Pei, Chaoying
    Xu, Zhi
    You, Sixiong
    Sun, Jeffrey
    Dai, Ran
    [J]. 2023 62ND IEEE CONFERENCE ON DECISION AND CONTROL, CDC, 2023, : 7293 - 7298
  • [43] A sequential quadratically constrained quadratic programming method for unconstrained minimax problems
    Jian, Jin-bao
    Chao, Mian-tao
    [J]. JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 2010, 362 (01) : 34 - 45
  • [44] Optimality conditions for fuzzy constrained programming problems
    Osuna-Gomez, R.
    Chalco-Cano, Y.
    Hernandez-Jimenez, B.
    Aguirre-Cipe, I
    [J]. FUZZY SETS AND SYSTEMS, 2019, 362 : 35 - 54
  • [45] Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
    Zheng, Xiao Jin
    Sun, Xiao Ling
    Li, Duan
    [J]. MATHEMATICAL PROGRAMMING, 2011, 129 (02) : 301 - 329
  • [46] Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
    Xiao Jin Zheng
    Xiao Ling Sun
    Duan Li
    [J]. Mathematical Programming, 2011, 129 : 301 - 329
  • [47] Nonconvex quadratically constrained quadratic programming: best D.C. decompositions and their SDP representations
    Zheng, X. J.
    Sun, X. L.
    Li, D.
    [J]. JOURNAL OF GLOBAL OPTIMIZATION, 2011, 50 (04) : 695 - 712
  • [48] Nonconvex quadratically constrained quadratic programming: best D.C. decompositions and their SDP representations
    X. J. Zheng
    X. L. Sun
    D. Li
    [J]. Journal of Global Optimization, 2011, 50 : 695 - 712
  • [49] On the sequential quadratically constrained quadratic programming methods
    Solodov, MV
    [J]. MATHEMATICS OF OPERATIONS RESEARCH, 2004, 29 (01) : 64 - 79
  • [50] On convex relaxations for quadratically constrained quadratic programming
    Anstreicher, Kurt M.
    [J]. MATHEMATICAL PROGRAMMING, 2012, 136 (02) : 233 - 251