Distributed actuator selection: achieving optimality via a primal-dual algorithm
This letter addresses the actuator selection problem, i.e., given an interconnection of asymptotically stable linear dynamical systems on a network and m possible actuators choose ν among them to achieve a certain objective. In general, this is a combinatorial optimization problem which is hard to s...
Päätekijät: | Romao, L, Papachristodoulou, A, Margellos, K |
---|---|
Aineistotyyppi: | Journal article |
Kieli: | English |
Julkaistu: |
IEEE
2018
|
Samankaltaisia teoksia
-
Convergence rate analysis of a subgradient averaging algorithm for distributed optimisation with different constraint sets
Tekijä: Romao, L, et al.
Julkaistu: (2020) -
Implementing primal-dual network flow algorithms
Julkaistu: (2004) -
Strongly Polynomial Primal-Dual Algorithms for Concave Cost Combinatorial Optimization Problems
Tekijä: Magnanti, Thomas L., et al.
Julkaistu: (2012) -
Tight generalization guarantees for the sampling and discarding approach to scenario optimization
Tekijä: Romao, L, et al.
Julkaistu: (2021) -
A Note on the Primal-Dual and Out-of-Kilter Algorithms for Network Optimization Problems
Tekijä: Shapiro, Jeremy F., 1939-
Julkaistu: (2004)