Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow

DOI10.1007/s10107-021-01737-9OpenAlexW3088334794MaRDI QIDQ2689820

Anders Eltved, Samuel Burer

Publication date: 14 March 2023

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2009.12704

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26)

Uses Software

• CVX
• Mosek

Cites Work

• Unnamed Item
• Unnamed Item
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables
• Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming
• On the copositive representation of binary and continuous nonconvex quadratic programs
• The trust region subproblem with non-intersecting linear constraints
• Global Optimization with Polynomials and the Problem of Moments
• A Note on Polynomial Solvability of the CDT Problem
• Kronecker Product Constraints with an Application to the Two-Trust-Region Subproblem
• On Nonconvex Quadratic Programming with Box Constraints
• New Results on Quadratic Minimization
• Trust Region Methods
• Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
• Second-Order-Cone Constraints for Extended Trust-Region Subproblems
• Convex Relaxation of Optimal Power Flow—Part I: Formulations and Equivalence
• Convex Relaxation of Optimal Power Flow—Part II: Exactness
• On Cones of Nonnegative Quadratic Functions