Article

# A Majorization-Minimization Approach to Design of Power Transmission Networks

04/2010; DOI:10.1109/CDC.2010.5717226
Source: arXiv

ABSTRACT We propose an optimization approach to design cost-effective electrical power transmission networks. That is, we aim to select both the network structure and the line conductances (line sizes) so as to optimize the trade-off between network efficiency (low power dissipation within the transmission network) and the cost to build the network. We begin with a convex optimization method based on the paper ``Minimizing Effective Resistance of a Graph'' [Ghosh, Boyd \& Saberi]. We show that this (DC) resistive network method can be adapted to the context of AC power flow. However, that does not address the combinatorial aspect of selecting network structure. We approach this problem as selecting a subgraph within an over-complete network, posed as minimizing the (convex) network power dissipation plus a non-convex cost on line conductances that encourages sparse networks where many line conductances are set to zero. We develop a heuristic approach to solve this non-convex optimization problem using: (1) a continuation method to interpolate from the smooth, convex problem to the (non-smooth, non-convex) combinatorial problem, (2) the majorization-minimization algorithm to perform the necessary intermediate smooth but non-convex optimization steps. Ultimately, this involves solving a sequence of convex optimization problems in which we iteratively reweight a linear cost on line conductances to fit the actual non-convex cost. Several examples are presented which suggest that the overall method is a good heuristic for network design. We also consider how to obtain sparse networks that are still robust against failures of lines and/or generators. Comment: 8 pages, 3 figures. To appear in Proc. 49th IEEE Conference on Decision and Control (CDC '10)

0 0
·
0 Bookmarks
·
81 Views
• Source
##### Article: Structure, scaling, and phase transition in the optimal transport network.
[hide abstract]
ABSTRACT: The structure and properties of optimal networks depend on the cost functional being minimized and on constraints to which the minimization is subject. We show here two different formulations that lead to identical results: minimizing the dissipation rate of an electrical network under a global constraint is equivalent to the minimization of a power-law cost function introduced by Banavar et al. [Phys. Rev. Lett. 84, 4745 (2000)10.1103/PhysRevLett.84.4745]. An explicit scaling relation between the currents and the corresponding conductances is derived, proving the potential flow nature of the latter. Varying a unique parameter, the topology of the optimized networks shows a transition from a tree topology to a very redundant structure with loops; the transition corresponds to a discontinuity in the slope of the power dissipation.
Physical Review Letters 03/2007; 98(8):088702. · 7.94 Impact Factor
• Source
##### Article: Enhancing Sparsity by Reweighted ℓ1 Minimization
[hide abstract]
ABSTRACT: It is now well understood that (1) it is possible to reconstruct sparse signals exactly from what appear to be highly incomplete sets of linear measurements and (2)that this can be done by constrained ℓ 1 minimization. In this paper, we study a novel method for sparse signal recovery that in many situations outperforms ℓ 1 minimization in the sense that substantially fewer measurements are needed for exact recovery. The algorithm consists of solving a sequence of weighted ℓ 1-minimization problems where the weights used for the next iteration are computed from the value of the current solution. We present a series of experiments demonstrating the remarkable performance and broad applicability of this algorithm in the areas of sparse signal recovery, statistical estimation, error correction and image processing. Interestingly, superior gains are also achieved when our method is applied to recover signals with assumed near-sparsity in overcomplete representations—not by reweighting the ℓ 1 norm of the coefficient sequence as is common, but by reweighting the ℓ 1 norm of the transformed object. An immediate consequence is the possibility of highly efficient data acquisition protocols by improving on a technique known as Compressive Sensing.
Journal of Fourier Analysis and Applications 11/2007; 14(5):877-905. · 1.08 Impact Factor
• Source
##### Conference Proceeding: Iteratively reweighted algorithms for compressive sensing
[hide abstract]
ABSTRACT: The theory of compressive sensing has shown that sparse signals can be reconstructed exactly from many fewer measurements than traditionally believed necessary. In [1], it was shown empirically that using lscr<sup>p</sup> minimization with p < 1 can do so with fewer measurements than with p = 1. In this paper we consider the use of iteratively reweighted algorithms for computing local minima of the nonconvex problem. In particular, a particular regularization strategy is found to greatly improve the ability of a reweighted least-squares algorithm to recover sparse signals, with exact recovery being observed for signals that are much less sparse than required by an unregularized version (such as FOCUSS, [2]). Improvements are also observed for the reweighted-lscr<sup>1</sup> approach of [3].
Acoustics, Speech and Signal Processing, 2008. ICASSP 2008. IEEE International Conference on; 05/2008 · 4.63 Impact Factor