Abstract
We consider the problem of growing connected networks of resistors where effective resistance is used as a performance metric. This problem can be cast as a semidefinite program by introducing an ℓl regularization into the optimal control formulation. For small networks this problem can be solved via standard interior point method solvers (e.g., SeDuMi or SDPT3). In this paper, we develop a primal-dual interior point algorithm that is well-suited for large-scale problems. The search direction is obtained using the direct method based on Cholesky factorization and iterative method based on the preconditioned conjugate gradient. We illustrate that both of these significantly outperform general-purpose solvers.
Original language | English (US) |
---|---|
Title of host publication | ACC 2015 - 2015 American Control Conference |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 1223-1228 |
Number of pages | 6 |
ISBN (Electronic) | 9781479986842 |
DOIs | |
State | Published - Jul 28 2015 |
Event | 2015 American Control Conference, ACC 2015 - Chicago, United States Duration: Jul 1 2015 → Jul 3 2015 |
Publication series
Name | Proceedings of the American Control Conference |
---|---|
Volume | 2015-July |
ISSN (Print) | 0743-1619 |
Conference
Conference | 2015 American Control Conference, ACC 2015 |
---|---|
Country/Territory | United States |
City | Chicago |
Period | 7/1/15 → 7/3/15 |
Bibliographical note
Publisher Copyright:© 2015 American Automatic Control Council.
Keywords
- Convex optimization
- interior-point method
- resistive networks
- semidefinite programming
- ℓ minimization