A tight compact quadratically constrained convex relaxation of the Optimal Power Flow problem
Year of publication: |
2024
|
---|---|
Authors: | Lambert, Amélie |
Published in: |
Computers & operations research : an international journal. - Amsterdam [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 1499736-8. - Vol. 166.2024, Art.-No. 106626, p. 1-12
|
Subject: | Semidefinite programming | Global optimization | Optimal Power Flow | Quadratic convex relaxation | Quadratically constrained quadratic programming |
-
On solving quadratically contrained quadratic programming problem with one non-convex constraint
Keyanpour, Mohammad, (2018)
-
Jiang, Rujun, (2023)
-
Semidefinite representable reformulations for two variants of the trust-region subproblem
Kelly, Sarah, (2023)
- More ...
-
An efficient compact quadratic convex reformulation for general integer quadratic programs
Billionnet, Alain, (2013)
-
Using a Conic Bundle method to accelerate both phases of a quadratic convex reformulation
Billionnet, Alain, (2017)
-
New optimization models for optimal classification trees
Ales, Zacharie, (2024)
- More ...