Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 2 of 2 for “"Electrical flows"”.

  1. Subset Selection via Spectral Objectives

    … Finally, we turn to a practical problem in electrical network design called the network reconfiguration problem. After analyzing various convex relaxations for the problem we propose a collection of potential upper and lower bound algorithms, and compare them practically.

    gatech Repository record for Subset Selection via Spectral Objectives (opens in a new tab)

  2. Bridging Discrete and Continuous Methods for Faster Optimization and Machine Learning

    … such that the energy of the (unique) feasible electrical flow over $T$ is minimized. We prove the first approximation factor for this problem since it emerged in 1989. We propose a randomized iterative rounding algorithm that rounds a relaxed point in the relative interior of the flow polytope …

    gatech Repository record for Bridging Discrete and Continuous Methods for Faster Optimization and Machine Learning (opens in a new tab)