A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables
From MaRDI portal
Publication:1675255
DOI10.1007/S10107-016-1095-2zbMath1380.65102arXiv1705.09057OpenAlexW2559883687MaRDI QIDQ1675255
Shmuel S. Oren, Chen Chen, Atamtürk, Alper
Publication date: 27 October 2017
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.09057
algorithmsemidefinite programmingnumerical examplesnonconvexquadratic programming problemsoptimal power flow problembranch-and-cut approach
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items (13)
Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches ⋮ New semidefinite relaxations for a class of complex quadratic programming problems ⋮ A graphic structure based branch-and-bound algorithm for complex quadratic optimization and applications to magnitude least-square problem ⋮ Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow ⋮ Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem ⋮ Penalized semidefinite programming for quadratically-constrained quadratic optimization ⋮ Strong NP-hardness of AC power flows feasibility ⋮ A geometric branch and bound method for robust maximization of convex functions ⋮ Convex Relaxations for Quadratic On/Off Constraints and Applications to Optimal Transmission Switching ⋮ A Bilevel Approach for Identifying the Worst Contingencies for Nonconvex Alternating Current Power Systems ⋮ AC optimal power flow: a conic programming relaxation and an iterative MILP scheme for global optimization ⋮ Optimization hierarchy for fair statistical decision problems ⋮ Operations research in optimal power flow: a guide to recent and emerging methodologies and applications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- GLOMIQO: global mixed-integer quadratic optimizer
- Approximation methods for complex polynomial optimization
- Positive definite completions of partial Hermitian matrices
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- A simplicial branch-and-bound method for solving nonconvex all-quadratic programs
- Globally solving nonconvex quadratic programming problems via completely positive programming
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- Branching rules revisited
- BARON: A general purpose global optimization software package
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Phase recovery, MaxCut and complex semidefinite programming
- Computable representations for convex hulls of low-dimensional quadratic forms
- Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
- Lagrangian Duality and Branch-and-Bound Algorithms for Optimal Power Flow
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- Branching and bounds tighteningtechniques for non-convex MINLP
- Electrical Transmission System Cascades and Vulnerability
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Design of Optimized Radar Codes With a Peak to Average Power Ratio Constraint
- Randomized Algorithms for Optimal Solutions of Double-Sided QCQP With Applications in Signal Processing
- Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables
- Complex Matrix Decomposition and Quadratic Programming
- Mixed-integer nonlinear optimization
- Extended Matrix Cube Theorems with Applications to μ-Theory in Control
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
This page was built for publication: A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables
