相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。On the tightness of SDP relaxations of QCQPs
Alex L. Wang et al.
MATHEMATICAL PROGRAMMING (2022)
TSSOS: A MOMENT-SOS HIERARCHY THAT EXPLOITS TERM SPARSITY
Jie Wang et al.
SIAM JOURNAL ON OPTIMIZATION (2021)
Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
Samuel Burer et al.
MATHEMATICAL PROGRAMMING (2020)
The geometry of SDP-exactness in quadratic optimization
Diego Cifuentes et al.
MATHEMATICAL PROGRAMMING (2020)
Exploiting Symmetry in the Power Flow Equations Using Monodromy
Julia Lindberg et al.
ACM COMMUNICATIONS IN COMPUTER ALGEBRA (2020)
A Novel Quadratically Constrained Quadratic Programming Method for Optimal Coordination of Directional Overcurrent Relays
Vasileios A. Papaspiliotopoulos et al.
IEEE TRANSACTIONS ON POWER DELIVERY (2017)
Some results for quadratic problems with one or two quadratic constraints
Marco Locatelli
OPERATIONS RESEARCH LETTERS (2015)
The unconstrained binary quadratic programming problem: a survey
Gary Kochenberger et al.
JOURNAL OF COMBINATORIAL OPTIMIZATION (2014)
Optimality conditions and finite convergence of Lasserre's hierarchy
Jiawang Nie
MATHEMATICAL PROGRAMMING (2014)
EXACTNESS OF SEMIDEFINITE RELAXATIONS FOR NONLINEAR OPTIMIZATION PROBLEMS WITH UNDERLYING GRAPH STRUCTURE
Somayeh Sojoudi et al.
SIAM JOURNAL ON OPTIMIZATION (2014)
Dynamic Economic Dispatch Considering Transmission Losses Using Quadratically Constrained Quadratic Program Method
Haiwang Zhong et al.
IEEE TRANSACTIONS ON POWER SYSTEMS (2013)
Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
Cordian Riener et al.
MATHEMATICS OF OPERATIONS RESEARCH (2013)
Semidefinite Relaxation of Quadratic Optimization Problems
Zhi-Quan Luo et al.
IEEE SIGNAL PROCESSING MAGAZINE (2010)
Convex hull of two quadratic constraints is an LMI set
Ugur Yildiran
IMA JOURNAL OF MATHEMATICAL CONTROL AND INFORMATION (2009)
Semidefinite programming relaxations for semialgebraic problems
PA Parrilo
MATHEMATICAL PROGRAMMING (2003)
Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxations
SY Kim et al.
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (2003)
Global optimization with polynomials and the problem of moments
JB Lasserre
SIAM JOURNAL ON OPTIMIZATION (2001)
分享论文
