Pages that link to "Item:Q1675255"

The following pages link to A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables (Q1675255):

Displaying 12 items.

• Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches (Q1616947) (← links)
• Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem (Q1741115) (← links)
• Penalized semidefinite programming for quadratically-constrained quadratic optimization (Q2022173) (← links)
• A geometric branch and bound method for robust maximization of convex functions (Q2052396) (← links)
• AC optimal power flow: a conic programming relaxation and an iterative MILP scheme for global optimization (Q2095185) (← links)
• Optimization hierarchy for fair statistical decision problems (Q2112802) (← links)
• Operations research in optimal power flow: a guide to recent and emerging methodologies and applications (Q2116838) (← links)
• Strong NP-hardness of AC power flows feasibility (Q2294366) (← links)
• Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow (Q2689820) (← links)
• Convex Relaxations for Quadratic On/Off Constraints and Applications to Optimal Transmission Switching (Q3386791) (← links)
• New semidefinite relaxations for a class of complex quadratic programming problems (Q6166105) (← links)
• A graphic structure based branch-and-bound algorithm for complex quadratic optimization and applications to magnitude least-square problem (Q6183088) (← links)