Dual <inline-formula> <tex-math notation="LaTeX">${M}$ </tex-math></inline-formula>-Convex Variable Subsets Family and Extremum Analysis for the OPF Problem

Dual <inline-formula> <tex-math notation="LaTeX">${M}$ </tex-math></inline-formula>-Convex Variable Subsets Family and Extremum Analysis for the OPF Problem

The optimal power flow (OPF) model is a central optimization problem in power system network. In this paper, we propose a novel approach to solve the OPF problem that has a convex objective function and non-convex feasible domain due to the constraints. Based on the concept of abstract convex analys...

Full description

Bibliographic Details
Main Authors: Liulin Yang, Naishan Hang, Zhi Wei
Format: Article
Language:English
Published: IEEE 2018-01-01
Series:IEEE Access
Subjects:
Abstract convex analysis
dual M-convex
global optimization
KKT condition
optimal power flow
Online Access:https://ieeexplore.ieee.org/document/8353369/

Internet

https://ieeexplore.ieee.org/document/8353369/

Similar Items