Second-order cone AC optimal power flow: convex relaxations and feasible solutions
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
2196-5420
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
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
- Klassifikation
-
Elektrotechnik, Elektronik
- Urheber
-
YUAN, Zhao
- Beteiligte Personen und Organisationen
-
HESAMZADEH, Mohammad Reza
SpringerLink (Online service)
- DOI
-
10.1007/s40565-018-0456-7
- URN
-
urn:nbn:de:101:1-2018112020082764049006
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2022, 21:51 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- YUAN, Zhao
- HESAMZADEH, Mohammad Reza
- SpringerLink (Online service)
Ähnliche Objekte (12)
Convex Relaxations of Componentwise Convex Functions
Convex relaxations for mixed-integer nonlinear programs
Convex Quadratic Programming Relaxations for Network Scheduling Problems
Convex quadratic and semidefinite programming relaxations in Scheduling
Tight Convex Relaxations for the Expansion Planning Problem
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
Strengthening convex relaxations of 0/1-sets using Boolean formulas
Using dual relaxations in multiobjective mixed-integer convex quadratic programming
Minimax Tests for Convex Cones
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
Convex Quadratic Programming Relaxations for Network Scheduling Problems
Convex quadratic and semidefinite programming relaxations in Scheduling
Tight Convex Relaxations for the Expansion Planning Problem
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
Strengthening convex relaxations of 0/1-sets using Boolean formulas
Using dual relaxations in multiobjective mixed-integer convex quadratic programming
Minimax Tests for Convex Cones
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
Convex Quadratic Programming Relaxations for Network Scheduling Problems
Convex quadratic and semidefinite programming relaxations in Scheduling
Tight Convex Relaxations for the Expansion Planning Problem
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
Strengthening convex relaxations of 0/1-sets using Boolean formulas
Using dual relaxations in multiobjective mixed-integer convex quadratic programming
Minimax Tests for Convex Cones