Results 1  10
of
4,729
Global Stability with TimeDelay of a PrimalDual Congestion Control
 Proc. of the 42nd IEEE Conference on Decision and Control, Maui
, 2003
"... This paper concerns network congestion control, focusing on a recently proposed "primaldual" control law that has been shown to give local stability and desirable equilibrium properties for networks of arbitrary capacity and a fixed bound on delay. ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
This paper concerns network congestion control, focusing on a recently proposed "primaldual"; control law that has been shown to give local stability and desirable equilibrium properties for networks of arbitrary capacity and a fixed bound on delay.
PRIMALDUAL KERNEL MACHINES
, 2005
"... Proefschrift voorgedragen tot het behalen van het doctoraat in de ingenieurswetenschappen door ..."
Abstract
 Add to MetaCart
Proefschrift voorgedragen tot het behalen van het doctoraat in de ingenieurswetenschappen door
Maximizing Queueing Network Utility Subject to Stability: Greedy Primaldual algorithm
 Queueing Systems
, 2005
"... We study a model of controlled queueing network, which operates and makes control decisions in discrete time. An underlying random network mode determines the set of available controls in each time slot. Each control decision \produces " a certain vector of \commodities"; it also has assoc ..."
Abstract

Cited by 201 (9 self)
 Add to MetaCart
is the average value of commodity vector, subject to the constraint that network queues remain stable. We introduce a dynamic control algorithm, which we call Greedy PrimalDual (GPD) algorithm, and prove its asymptotic optimality. We show that our network model and GPD algorithm accommodate a wide range
ATOMIC DECOMPOSITION BY BASIS PURSUIT
, 1995
"... The TimeFrequency and TimeScale communities have recently developed a large number of overcomplete waveform dictionaries  stationary wavelets, wavelet packets, cosine packets, chirplets, and warplets, to name a few. Decomposition into overcomplete systems is not unique, and several methods for d ..."
Abstract

Cited by 2684 (61 self)
 Add to MetaCart
successfully only because of recent advances in linear programming by interiorpoint methods. We obtain reasonable success with a primaldual logarithmic barrier method and conjugategradient solver.
PrimalDual meets Local Search: . . .
"... We present a new bicriteria approximation algorithm for the degreebounded minimumcost spanning tree problem: Given an undirected graph with nonnegative edge weights and a degree bound B nd a spanning tree of maximum nodedegree B and minimum total edgecost. Our algorithm outputs a tree of maximum ..."
Abstract
 Add to MetaCart
to "age " more and more), leading to overall progress and a proof of the performan
e guarantee. A se
ond useful feature of our algorithm is that it an handle nonuniform degree bounds on the nodes: Given distin
t bounds B v for every node v 2 V, the output tree has degree at most O(B v + log jV j
InfeasibleStart PrimalDual Methods And Infeasibility Detectors For Nonlinear Programming Problems
 Mathematical Programming
, 1996
"... In this paper we present several "infeasiblestart" pathfollowing and potentialreduction primaldual interiorpoint methods for nonlinear conic problems. These methods try to find a recession direction of the feasible set of a selfdual homogeneous primaldual problem. The methods under ..."
Abstract

Cited by 38 (6 self)
 Add to MetaCart
In this paper we present several "infeasiblestart"; pathfollowing and potentialreduction primaldual interiorpoint methods for nonlinear conic problems. These methods try to find a recession direction of the feasible set of a selfdual homogeneous primaldual problem. The methods under
Ascending Price Vickrey Auctions Using PrimalDual Algorithms
, 2004
"... The direct VickreyClarkeGroves (VCG) mechanism requires solving underlying optimization problems of the main economy and of every "marginal" economy. We show that VCG outcome can be implemented using a competitive equilibrium (CE) of the main economy if and only if that CE price is al ..."
Abstract

Cited by 12 (7 self)
 Add to MetaCart
The direct VickreyClarkeGroves (VCG) mechanism requires solving underlying optimization problems of the main economy and of every "marginal"; economy. We show that VCG outcome can be implemented using a competitive equilibrium (CE) of the main economy if and only if that CE price
A New Class of Polynomial PrimalDual Methods for Linear and Semidefinite Optimization
, 1999
"... We propose a new class of primaldual methods for linear optimization (LO). By using some new analysis tools, we prove that the large update method for LO based on the new search direction has a polynomial complexity O i n 4 4+ae log n " j iterations where ae 2 [0; 2] is a parameter used ..."
Abstract

Cited by 10 (7 self)
 Add to MetaCart
We propose a new class of primaldual methods for linear optimization (LO). By using some new analysis tools, we prove that the large update method for LO based on the new search direction has a polynomial complexity O i n 4 4+ae log n " j iterations where ae 2 [0; 2] is a parameter
A PrimalDual Interior Point Method Whose Running Time Depends Only on the Constraint Matrix
, 1995
"... We propose a primaldual "layeredstep " interior point (LIP) algorithm for linear programming with data given by real numbers. This algorithm follows the central path, either with short steps or with a new type of step called a "layered least squares " (LLS) ste ..."
Abstract

Cited by 56 (8 self)
 Add to MetaCart
We propose a primaldual "layeredstep " interior point (LIP) algorithm for linear programming with data given by real numbers. This algorithm follows the central path, either with short steps or with a new type of step called a "layered least squares " (LLS
Results 1  10
of
4,729