Convexification of generalized network flow problem
From MaRDI portal
Publication:1717233
DOI10.1007/s10107-017-1223-7zbMath1410.90170OpenAlexW2783225128MaRDI QIDQ1717233
Somayeh Sojoudi, Salar Fattahi, Javad Lavaei
Publication date: 7 February 2019
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-017-1223-7
convex optimizationconvex relaxationnetwork flowoptimal power flowlossy networkselectrical power networks
Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Deterministic network models in operations research (90B10)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polynomial-time primal simplex algorithms for the minimum cost network flow problem
- Minimum cost capacity installation for multicommodity network flows
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
- Robust discrete optimization and network flows
- Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
- Global Optimization with Polynomials and the Problem of Moments
- The Traffic Flow Management Rerouting Problem in Air Traffic Control: A Dynamic Network Flow Approach
- Strong SOCP Relaxations for the Optimal Power Flow Problem
- New Methods in Mathematical Programming—Optimal Flow Through Networks with Gains
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Convex Restriction of Power Flow Feasibility Sets
- Convexification of Power Flow Equations in the Presence of Noisy Measurements
- Exactness of Semidefinite Relaxations for Nonlinear Optimization Problems with Underlying Graph Structure
- Convex Relaxation of Optimal Power Flow—Part I: Formulations and Equivalence
- Convex Relaxation of Optimal Power Flow—Part II: Exactness
- A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
- Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization
- Applied Optimization
