Results 1  10
of
22,329
A primaldual algorithm for BSDEs
, 2013
"... Extraktion quantifizierbarer Information aus komplexen Systemen” ..."
Abstract

Cited by 14 (1 self)
 Add to MetaCart
Extraktion quantifizierbarer Information aus komplexen Systemen”
New PrimalDual Algorithms for Steiner Tree Problems
"... We present new primaldual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree problem (DST), and the set cover problem (SC) which is a subcase of DST. All our problems are NPhard; so we are interested in ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We present new primaldual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree problem (DST), and the set cover problem (SC) which is a subcase of DST. All our problems are NPhard; so we are interested
Primaldual algorithms for connected facility location problems
 Algorithmica
, 2002
"... We consider the Connected Facility Location problem. We are given a graph G = (V, E) with costs {ce} on the edges, a set of facilities F ⊆ V, and a set of clients D ⊆ V. Facility i has a facility opening cost fi and client j has dj units of demand. We are also given a parameter M ≥ 1. A solution ope ..."
Abstract

Cited by 75 (7 self)
 Add to MetaCart
and facilities may be opened anywhere, i.e., F = V. If we know a facility v that is open, then the problem becomes a special case of the singlesink buyatbulk problem with two cable types, also known as the rentorbuy problem. We give the first primaldual algorithms for these problems and achieve the best
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 425 (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
X.: Convergence analysis of primaldual algorithms for total variation image restoration
, 2010
"... Abstract. Recently, some attractive primaldual algorithms have been proposed for solving a saddlepoint problem, with particular applications in the area of total variation (TV) image restoration. This paper focuses on the convergence analysis of existing primaldual algorithms and shows that the i ..."
Abstract

Cited by 28 (2 self)
 Add to MetaCart
Abstract. Recently, some attractive primaldual algorithms have been proposed for solving a saddlepoint problem, with particular applications in the area of total variation (TV) image restoration. This paper focuses on the convergence analysis of existing primaldual algorithms and shows
A PrimalDual Algorithm for Minimizing a Sum of Euclidean Norms
, 2000
"... We study the problem of minimizing a sum of Euclidean norms. This nonsmooth optimization problem arises in many different kinds of modern scientific applications. In this paper we first transform this problem and its dual problem into a system of strongly semismooth equations, and give some uniquene ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
uniqueness theorems for this problem. We then present a primaldual algorithm for this problem by solving this system of strongly semismooth equations. Preliminary numerical results are reported, which show that this primaldual algorithm is very promising.
Group Strategyproof Mechanisms via PrimalDual Algorithms
 In Proceedings of the 44th Annual Symposium on Foundations of Computer Science (FOCS
, 2003
"... We develop a general method for costsharing that is approximately budget balanced and group strategyproof. We use our method to design cost sharing mechanisms for two NPcomplete problems: metric facility location, and single source rentorbuy network design. Both mechanisms are competitive, group ..."
Abstract

Cited by 64 (4 self)
 Add to MetaCart
We develop a general method for costsharing that is approximately budget balanced and group strategyproof. We use our method to design cost sharing mechanisms for two NPcomplete problems: metric facility location, and single source rentorbuy network design. Both mechanisms are competitive, group strategyproof and recover a constant fraction of the cost. For the facility location game our costsharing method recovers a 1/3rd of the total cost, while in the network design game the cost shares pay for a 1/15 fraction of the cost of the solution.
Online PrimalDual Algorithms for Covering and Packing Problems
"... We study a wide range of online covering and packing optimization problems. In an online covering problem a linear cost function is known in advance, but the linear constraints that define the feasible solution space are given one by one in an online fashion. In an online packing problem the profit ..."
Abstract

Cited by 45 (6 self)
 Add to MetaCart
deterministic algorithms for several integral online covering and packing problems. Our scheme is designed via a novel primaldual technique that extends the scheme used for many offline optimization problems. Recently, it was shown that this general primaldual framework is useful for capturing many more
Lecture 5: PrimalDual Algorithms and Facility Location
, 2008
"... In the last lecture, we saw an LP rounding algorithm for the metric uncapacitated facility location problem that achieves 4approximation. In this lecture, we will see how the concepts of linear programming duality and complementary slackness can be used to get better approximation algorithms for UF ..."
Abstract
 Add to MetaCart
T x (D) max b T y s.t. Ax ≥ b s.t. A T y ≤ c x ≥ 0 y ≥ 0 A ∈ R m×n Figure 1: Primal (P) and dual (D) linear programs in canonical form. Dual linear programs are very useful to obtain bounds on the optimal value of the primal linear programs using the following two duality theorems. Theorem 1.1. Weak
Primaldual algorithms for QoS multimedia multicast
 IN PROCEEDINGS. OF IEEE GLOBECOM, 3631. 5505—CHAPTER 71—4/9/2006—01:53—SRIDHAR—14632—XML MODEL CRC12A
, 2003
"... The QoS Steiner Tree Problem asks for the most costefficient way to multicast multimedia to a heterogeneous collection of users with different consumption rates. We assume that the cost of using a link is not constant but rather depends on the maximum bandwidth routed through the link. Formally, gi ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
at least as large as the bandwidth required by the terminal. Our main contributions are: (1) new coveringtype integer linear program formulations for the problem; (2) two new heuristics based on the primaldual framework; (3) a primaldual constantfactor approximation algorithm; (4) an extensive
Results 1  10
of
22,329