Second-order cone AC optimal power flow: convex relaxations and feasible solutions
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
2196-5420
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Second-order cone AC optimal power flow: convex relaxations and feasible solutions ; day:15 ; month:10 ; year:2018 ; pages:1-13
Journal of modern power systems and clean energy ; (15.10.2018), 1-13
- Classification
-
Elektrotechnik, Elektronik
- Creator
-
YUAN, Zhao
- Contributor
-
HESAMZADEH, Mohammad Reza
SpringerLink (Online service)
- DOI
-
10.1007/s40565-018-0456-7
- URN
-
urn:nbn:de:101:1-2018112020082764049006
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:51 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- YUAN, Zhao
- HESAMZADEH, Mohammad Reza
- SpringerLink (Online service)
Other Objects (12)
Convex Relaxations of Componentwise Convex Functions
Convex relaxations for mixed-integer nonlinear programs
Tight Convex Relaxations for the Expansion Planning Problem
Convex Quadratic Programming Relaxations for Network Scheduling Problems
Convex quadratic and semidefinite programming relaxations in Scheduling
New convex relaxations and global optimality in variational imaging
New Convex Relaxations and Global Optimality in Variational Imaging
A strictly feasible sequential convex programming method
Minimax Tests for Convex Cones
Strengthening convex relaxations of 0/1-sets using Boolean formulas
Using dual relaxations in multiobjective mixed-integer convex quadratic programming
A prediction-correction inexact alternating direction method for convex nonlinear second-order cone programming with linear constraints
Convex Relaxations of Componentwise Convex Functions
Convex relaxations for mixed-integer nonlinear programs
Tight Convex Relaxations for the Expansion Planning Problem
Convex Quadratic Programming Relaxations for Network Scheduling Problems
Convex quadratic and semidefinite programming relaxations in Scheduling
New convex relaxations and global optimality in variational imaging
New Convex Relaxations and Global Optimality in Variational Imaging
A strictly feasible sequential convex programming method
Minimax Tests for Convex Cones
Strengthening convex relaxations of 0/1-sets using Boolean formulas
Using dual relaxations in multiobjective mixed-integer convex quadratic programming
A prediction-correction inexact alternating direction method for convex nonlinear second-order cone programming with linear constraints
Convex Relaxations of Componentwise Convex Functions
Convex relaxations for mixed-integer nonlinear programs
Tight Convex Relaxations for the Expansion Planning Problem
Convex Quadratic Programming Relaxations for Network Scheduling Problems
Convex quadratic and semidefinite programming relaxations in Scheduling
New convex relaxations and global optimality in variational imaging
New Convex Relaxations and Global Optimality in Variational Imaging
A strictly feasible sequential convex programming method
Minimax Tests for Convex Cones
Strengthening convex relaxations of 0/1-sets using Boolean formulas
Using dual relaxations in multiobjective mixed-integer convex quadratic programming