Pages that link to "Item:Q2957450"

The following pages link to Strong SOCP Relaxations for the Optimal Power Flow Problem (Q2957450):

Displaying 35 items.

• On the robustness and scalability of semidefinite relaxation for optimal power flow problems (Q779755) (← links)
• Unified value-based feedback, optimization and risk management in complex electric energy systems (Q779759) (← links)
• Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches (Q1616947) (← links)
• Global optimal power flow over large-scale power transmission networks (Q1624891) (← links)
• Global optimization for optimal power flow over transmission networks (Q1683333) (← links)
• Convex quadratic relaxations for mixed-integer nonlinear programs in power systems (Q1688449) (← links)
• Multi-objective mean-variance-skewness model for nonconvex and stochastic optimal power flow considering wind power and load uncertainties (Q1694953) (← links)
• Convexification of generalized network flow problem (Q1717233) (← links)
• Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem (Q1741115) (← links)
• A game-theoretic analysis of transmission-distribution system operator coordination (Q1755264) (← links)
• A survey on conic relaxations of optimal power flow problem (Q2023908) (← links)
• AC optimal power flow: a conic programming relaxation and an iterative MILP scheme for global optimization (Q2095185) (← links)
• Operations research in optimal power flow: a guide to recent and emerging methodologies and applications (Q2116838) (← links)
• Sparse PSD approximation of the PSD cone (Q2118107) (← links)
• On the \(r\)-uniform linear hypertrees with extremal Estrada indices (Q2177853) (← links)
• An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs (Q2274851) (← links)
• Strong NP-hardness of AC power flows feasibility (Q2294366) (← links)
• A geometric way to build strong mixed-integer programming formulations (Q2294389) (← links)
• On polyhedral and second-order cone decompositions of semidefinite optimization problems (Q2294533) (← links)
• A simultaneous diagonalization based SOCP relaxation for convex quadratic programs with linear complementarity constraints (Q2329678) (← links)
• Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow (Q2689820) (← links)
• A two-level distributed algorithm for nonconvex constrained optimization (Q2696920) (← links)
• Convex Relaxations for Quadratic On/Off Constraints and Applications to Optimal Transmission Switching (Q3386791) (← links)
• Robust Optimization for Electricity Generation (Q4995074) (← links)
• Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion (Q5058005) (← links)
• Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints (Q5060505) (← links)
• Hyperbolic Relaxation of $k$-Locally Positive Semidefinite Matrices (Q5072587) (← links)
• The Convex Hull of a Quadratic Constraint over a Polytope (Q5131962) (← links)
• Mathematical programming formulations for the alternating current optimal power flow problem (Q5918268) (← links)
• Mathematical programming formulations for the alternating current optimal power flow problem (Q5918757) (← links)
• On eigenvalues of symmetric matrices with PSD principal submatrices (Q6108376) (← links)
• Moving from linear to conic markets for electricity (Q6112625) (← links)
• Robust feasibility of systems of quadratic equations using topological degree theory (Q6151531) (← links)
• Subset Selection and the Cone of Factor-Width-<i>k</i> Matrices (Q6195312) (← links)
• A tight compact quadratically constrained convex relaxation of the optimal power flow problem (Q6568415) (← links)