Convex relaxations for quadratic on/off constraints and applications to optimal transmission switching
DOI10.1287/IJOC.2019.0900zbMATH Open1474.90435OpenAlexW2978134471MaRDI QIDQ3386791FDOQ3386791
Authors: Ksenia Bestuzheva, Hassan Hijazi, Carleton Coffrin 
Publication date: 7 January 2021
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://www.osti.gov/biblio/1688736
Recommendations
- Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
- Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs
- Mixed integer nonlinear programs featuring ``on/off constraints: convex analysis and applications
- Strong SOCP relaxations for the optimal power flow problem
- scientific article; zbMATH DE number 6985727
mixed integer nonlinear programmingtrigonometric functionsoptimal transmission switchingon/off constraintsperspective relaxation
Cites Work
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- A branch-and-cut method for 0-1 mixed convex programming
- Convex programming for disjunctive convex optimization
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Perspective cuts for a class of convex 0-1 mixed integer programs
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- On mathematical programming with indicator constraints
- Mixed-integer nonlinear programs featuring ``on/off constraints
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- On handling indicator constraints in mixed integer programming
- Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
- A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables
- Power transmission network expansion planning: a semidefinite programming branch-and-bound approach
Cited In (8)
- Convexity/nonconvexity certificates for power flow analysis
- Title not available (Why is that?)
- Node-based valid inequalities for the optimal transmission switching problem
- A computational study of perspective cuts
- Tight convex relaxations for the expansion planning problem
- Mixed integer nonlinear programs featuring ``on/off constraints: convex analysis and applications
- Mixed-integer nonlinear programs featuring ``on/off constraints
- Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
Uses Software
This page was built for publication: Convex relaxations for quadratic on/off constraints and applications to optimal transmission switching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3386791)
