Results 1  10
of
65,217
An eventtriggered distributed primaldual algorithm for network utility maximization
 in Proc. IEEE Conf. Decision Control, 2009
"... Abstract — Many problems associated with networked systems can be formulated as network utility maximization (NUM) problems. NUM problems maximize a global separable measure of network optimality subject to linear constraints on resources. Dual decomposition is a widely used distributed algorithm t ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
to these measures. This paper presents a distributed primaldual algorithm for the NUM problem that uses eventtriggering. Under event triggering, each agent broadcasts to its neighbors when a local “error ” signal exceeds a state dependent threshold. The paper establishes such statedependent event
A Duality Model of TCP and Queue Management Algorithms
 IEEE/ACM Trans. on Networking
, 2002
"... We propose a duality model of congestion control and apply it to understand the equilibrium properties of TCP and active queue management schemes. Congestion control is the interaction of source rates with certain congestion measures at network links. The basic idea is to regard source rates as p ..."
Abstract

Cited by 307 (37 self)
 Add to MetaCart
as primal variables and congestion measures as dual variables, and congestion control as a distributed primaldual algorithm carried out over the Internet to maximize aggregate utility subject to capacity constraints. The primal iteration is carried out by TCP algorithms such as Reno or Vegas
Power System Dynamics as PrimalDual 1 Algorithm for Optimal Load Control
, 2013
"... We formulate an optimal load control (OLC) problem in power networks where the objective is to minimize the aggregate cost of tracking an operating point subject to power balance over the network. We prove that the swing dynamics and the branch power flows, coupled with frequencybased load control, ..."
Abstract
 Add to MetaCart
, serve as a distributed primaldual algorithm to solve OLC. Even though the system has multiple equilibrium points, we prove that it nonetheless converges to an optimal point. This result implies that the local frequency deviations at each bus convey exactly the right information about the global power
A firstorder primaldual algorithm for convex problems with applications to imaging
, 2010
"... In this paper we study a firstorder primaldual algorithm for convex optimization problems with known saddlepoint structure. We prove convergence to a saddlepoint with rate O(1/N) in finite dimensions, which is optimal for the complete class of nonsmooth problems we are considering in this paper ..."
Abstract

Cited by 436 (20 self)
 Add to MetaCart
In this paper we study a firstorder primaldual algorithm for convex optimization problems with known saddlepoint structure. We prove convergence to a saddlepoint with rate O(1/N) in finite dimensions, which is optimal for the complete class of nonsmooth problems we are considering
PrimalDual Monotone Kernel Regression
, 2004
"... This paper considers the estimation of monotone nonlinear regression based on Support Vector Machines (SVMs), Least Squares SVMs (LSSVMs) and kernel machines. It illustrates how to employ the primaldual optimization framework characterizing (LS)SVMs in order to derive a globally optimal onestage ..."
Abstract
 Add to MetaCart
This paper considers the estimation of monotone nonlinear regression based on Support Vector Machines (SVMs), Least Squares SVMs (LSSVMs) and kernel machines. It illustrates how to employ the primaldual optimization framework characterizing (LS)SVMs in order to derive a globally optimal one
Can Shortestpath Routing and TCP Maximize Utility
 IN INFOCOM ’03
, 2003
"... TCPAQM protocols can be interpreted as distributed primaldual algorithms over the Internet to maximize aggregate utility over source rates. In this paper we study whether TCPAQM together with shortestpath routing can maximize utility over both rates and routes. We show that this is generally ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
TCPAQM protocols can be interpreted as distributed primaldual algorithms over the Internet to maximize aggregate utility over source rates. In this paper we study whether TCPAQM together with shortestpath routing can maximize utility over both rates and routes. We show that this is generally
A primaldual randomized algorithm for weighted paging
 In Manuscript
, 2007
"... In the weighted paging problem there is a weight (cost) for fetching each page into the cache. We design a randomized O(log k)competitive online algorithm for the weighted paging problem, where k is the cache size. This is the first randomized o(k)competitive algorithm and its competitiveness matc ..."
Abstract

Cited by 22 (4 self)
 Add to MetaCart
paging problem is based on a twostep approach. In the first step we obtain an O(log k)competitive fractional algorithm which is based on a novel online primaldual approach. In the second step we obtain a randomized algorithm by rounding online the fractional solution to an actual distribution
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
, 1997
"... We present a new distributed routing protocol for mobile, multihop, wireless networks. The protocol is one of a family of protocols which we term "link reversal" algorithms. The protocol's reaction is structured as a temporallyordered sequence of diffusing computations; each computat ..."
Abstract

Cited by 1100 (6 self)
 Add to MetaCart
We present a new distributed routing protocol for mobile, multihop, wireless networks. The protocol is one of a family of protocols which we term "link reversal" algorithms. The protocol's reaction is structured as a temporallyordered sequence of diffusing computations; each
Randomized Gossip Algorithms
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 2006
"... Motivated by applications to sensor, peertopeer, and ad hoc networks, we study distributed algorithms, also known as gossip algorithms, for exchanging information and for computing in an arbitrarily connected network of nodes. The topology of such networks changes continuously as new nodes join a ..."
Abstract

Cited by 532 (5 self)
 Add to MetaCart
Motivated by applications to sensor, peertopeer, and ad hoc networks, we study distributed algorithms, also known as gossip algorithms, for exchanging information and for computing in an arbitrarily connected network of nodes. The topology of such networks changes continuously as new nodes join
Algorithmic mechanism design
 Games and Economic Behavior
, 1999
"... We consider algorithmic problems in a distributed setting where the participants cannot be assumed to follow the algorithm but rather their own selfinterest. As such participants, termed agents, are capable of manipulating the algorithm, the algorithm designer should ensure in advance that the agen ..."
Abstract

Cited by 662 (23 self)
 Add to MetaCart
We consider algorithmic problems in a distributed setting where the participants cannot be assumed to follow the algorithm but rather their own selfinterest. As such participants, termed agents, are capable of manipulating the algorithm, the algorithm designer should ensure in advance
Results 1  10
of
65,217