Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1707.00579

The Hybrid Transmission Grid Architecture: Benefits in Nodal Pricing

Matthias Hotz·Wolfgang Utschick
View original source ↗Read source document ↗Export metadata ↓

Abstract

Recently, we proposed a capacity expansion approach for transmission grids that combines the upgrade of transmission capacity with a transition in system structure to improve grid operation. The key to this concept is a particular hybrid AC/DC transmission grid architecture, which is obtained by uprating selected AC lines via a conversion to HVDC. We have shown that this system structure improves optimal power flow (OPF) solvability and that it can reduce the total generation costs. In this work, we study the benefits of this hybrid architecture in the context of a deregulated electricity market. We propose an efficient and accurate nodal pricing method based on locational marginal prices (LMPs) that utilizes a second-order cone relaxation of the OPF problem. Applicability of this method requires exactness of the relaxation, which is difficult to obtain for conventional meshed AC transmission grids. We prove that the hybrid architecture ensures applicability if the LMPs do not coincide with certain pathological price profiles, which are shown to be unlikely under normal operating conditions. Using this nodal pricing method, we demonstrate that upgrading to the hybrid architecture can not only increase the effective transmission capacity but also reduce the separation of nodal markets and improve the utilization of generation.

Explore related subjects

math.OC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Matthias Hotz, Wolfgang Utschick. 2017-08-29. The Hybrid Transmission Grid Architecture: Benefits in Nodal Pricing. https://doi.org/10.1109/tpwrs.2017.2733820

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Strategic Inference in Stackelberg Games: Optimal Control for Revealing Adversary Intent

We study a continuous-time stochastic Stackelberg game in which a leader seeks to accomplish a primary objective while inferring a hidden parameter of a rational follower. The follower solves an entropy-regularized linear-quadratic tracking problem and responds to the leader's trajectory with a randomized policy. Anticipating this response, the leader designs informative controls to maximize the estimation efficiency for the follower's latent intent, through maximum likelihood estimation. Unlike prior work on discrete-time or finite-candidate inverse learning, our framework enables continuous parameter inference without prior assumptions and endogenizes the information source through the follower's strategic feedback. We derive semi-explicit solutions, prove well-posedness, and develop recurrent neural network algorithms to approximate the leader's path-dependent control. Numerical experiments demonstrate how the leader balances task performance and information gain, highlighting the practical value of our approach for adversarial strategic inference.

math.OC↗
arXiv2026

Stratification for Nonlinear Semidefinite Programming

This paper introduces a stratification framework for nonlinear semidefinite programming (NLSDP) that reveals and utilizes the geometry behind the nonsmooth KKT system. Based on the index stratification of $\mathbb{S}^n$ and its lift to the primal-dual space, a stratified variational analysis is developed. Specifically, we define the stratum-restricted regularity property, characterize it by the verifiable weak second order condition (W-SOC) and weak strict Robinson constraint qualification (W-SRCQ), and interpret the W-SRCQ geometrically via transversality, with stability along strata. The interactions of these properties across neighboring strata are further examined, leading to the conclusion that classical strong-form regularity conditions correspond to the local uniform validity of stratum-restricted counterparts. On the algorithmic side, a stratified Gauss--Newton method with normal steps and a correction mechanism is proposed for globally solving the KKT equation through a least-squares merit function. We demonstrate that the algorithm converges globally to directional stationary points. Moreover, under the second order sufficient condition (SOSC) and the strict Robinson constraint qualification (SRCQ) at an accumulation point, with a suitable correction threshold, the whole sequence converges superlinearly to this point, which is a KKT pair, and eventually identifies the active stratum. The rate is quadratic if the problem data are additionally of class $LC^2$ near the solution.

math.OC↗
arXiv2026

Convergence Rate Analysis of SOAP with Arbitrary Orthogonal Projection Matrices

In this short note, we establish, for the first time, the convergence rate of SOAP, an efficient and popular matrix-based optimizer for training deep neural networks. Our analysis extends to a more general variant of SOAP that admits arbitrary orthogonal projection matrices and requires only that these matrices be conditionally independent of the current stochastic gradient at each iteration. For example, they may be constructed from information available up to the preceding step.

math.OC↗