Dual decomposition for multi-agent distributed optimization with coupling constraints

A Falsone, K Margellos, S Garatti, M Prandini - Automatica, 2017 - Elsevier
We study distributed optimization in a cooperative multi-agent setting, where agents have to
agree on the usage of shared resources and can communicate via a time-varying network to …

Wireless information and power transfer: Rate-energy tradeoff for nonlinear energy harvesting

JM Kang, IM Kim, DI Kim - IEEE Transactions on Wireless …, 2017 - ieeexplore.ieee.org
In this paper, we study rate-energy (RE) tradeoffs for simultaneous wireless information and
power transfer (SWIPT). In the existing literature, by invoking a simplistic and ideal …

Simple and fast convex relaxation method for cooperative localization in sensor networks using range measurements

C Soares, J Xavier, J Gomes - IEEE Transactions on Signal …, 2015 - ieeexplore.ieee.org
We address the sensor network localization problem given noisy range measurements
between pairs of nodes. We approach the nonconvex maximum-likelihood formulation via a …

Ground‐motion intensity and damage map selection for probabilistic infrastructure network risk assessment using optimization

M Miller, J Baker - Earthquake Engineering & Structural …, 2015 - Wiley Online Library
In many parts of the world, earthquakes threaten regional infrastructure systems. For
modeling risk using stochastic earthquake catalogs, random variables include rupture …

Deep neural networks with multi-branch architectures are intrinsically less non-convex

H Zhang, J Shao… - The 22nd International …, 2019 - proceedings.mlr.press
Several recently proposed architectures of neural networks such as ResNeXt, Inception,
Xception, SqueezeNet and Wide ResNet are based on the designing idea of having multiple …

[HTML][HTML] Optimal design-for-control of self-cleaning water distribution networks using a convex multi-start algorithm

B Jenks, F Pecci, I Stoianov - Water Research, 2023 - Elsevier
The provision of self-cleaning velocities has been shown to reduce the risk of discolouration
in water distribution networks (WDNs). Despite these findings, control implementations …

[PDF][PDF] Maximizing a sum of sigmoids

M Udell, S Boyd - Optimization and Engineering, 2013 - stanford.edu
The problem of maximizing a sum of sigmoidal functions over a convex constraint set arises
in many application areas. This objective captures the idea of decreasing marginal returns to …

A decentralized approach to multi-agent MILPs: finite-time feasibility and performance guarantees

A Falsone, K Margellos, M Prandini - Automatica, 2019 - Elsevier
We address the optimization of a large scale multi-agent system where each agent has
discrete and/or continuous decision variables that need to be set so as to optimize the sum …

Generalised lipschitz regularisation equals distributional robustness

Z Cranko, Z Shi, X Zhang, R Nock… - … on Machine Learning, 2021 - proceedings.mlr.press
The problem of adversarial examples has highlighted the need for a theory of regularisation
that is general enough to apply to exotic function classes, such as universal approximators …

QoE-aware bandwidth allocation for video traffic using sigmoidal programming

M Hemmati, B McCormick… - IEEE MultiMedia, 2017 - ieeexplore.ieee.org
The problem of bandwidth allocation in networks is traditionally solved using distributed rate
allocation algorithms under the general framework of network utility maximization (NUM) …