• Corpus ID: 14137115

# Online Covering with Convex Objectives and Applications

@article{Azar2014OnlineCW,
title={Online Covering with Convex Objectives and Applications},
author={Yossi Azar and Ilan Reuven Cohen and Debmalya Panigrahi},
journal={ArXiv},
year={2014},
volume={abs/1412.3507}
}
• Published 10 December 2014
• Computer Science
• ArXiv
We give an algorithmic framework for minimizing general convex objectives (that are differentiable and monotone non-decreasing) over a set of covering constraints that arrive online. This substantially extends previous work on online covering for linear objectives (Alon {\em et al.}, STOC 2003) and online covering with offline packing constraints (Azar {\em et al.}, SODA 2013). To the best of our knowledge, this is the first result in online optimization for generic non-linear objectives…

### Covering with Sum of l q-Norm Objectives

• Computer Science
• 2017
Improved online algorithms for non-uniform buy-at-bulk network design and the first online algorithm for throughput maximization under lp-norm edge capacities are obtained.

### Worst Case Competitive Analysis of Online Algorithms for Conic Optimization

• Computer Science, Mathematics
ArXiv
• 2016
This work derives a sufficient condition on the objective function that guarantees a constant worst case competitive ratio (greater than or equal to $\frac{1}{2}$) for monotone objective functions, and hence design effective smoothing customized for a given cost function.

### Designing smoothing functions for improved worst-case competitive ratio in online optimization

• Computer Science, Mathematics
NIPS
• 2016
The worst case competitive ratio of two primal-dual algorithms for a class of online convex (conic) optimization problems is analyzed and it is shown that the optimal smoothing can be derived by solving a convex optimization problem.

### Online Convex Covering and Packing Problems

• Mathematics, Computer Science
ArXiv
• 2015

## References

SHOWING 1-10 OF 36 REFERENCES

### Online Mixed Packing and Covering

• Computer Science, Mathematics
SODA
• 2013
This work demonstrates that the classical framework of solving optimization problems by obtaining a fractional solution to a linear program and rounding it to an integer solution can be extended to the online setting using primal-dual techniques and obtains the first algorithm that obtains a polylogarithmic competitive ratio for solving mixed LPs online.

### Online Primal-Dual Algorithms for Covering and Packing

• Computer Science, Mathematics
Math. Oper. Res.
• 2009
This work provides general deterministic primal-dual algorithms for online fractional covering and packing problems and also provides deterministic algorithms for several integral online covering andpacking problems.

### Approximation algorithms for scheduling on multiple machines

• Computer Science
46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05)
• 2005
We develop a single rounding algorithm for scheduling on unrelated parallel machines; this algorithm works well with the known linear programming, quadratic programming, and convex

### Convex programming for scheduling unrelated parallel machines

• Computer Science, Mathematics
STOC '05
• 2005
This work considers the classical problem of scheduling parallel unrelated machines and provides a 2-approximation algorithm for any fixed lp norm (p>1) and gives the first time that general convex programming techniques are used in the area of scheduling.

### Better bounds for online load balancing on unrelated machines

The first randomized online algorithms which outperform deterministic ones under any (integral) Lp norm for p = 2,…,137 are presented, providing a positive answer to the question whether randomization helps online load balancing under Lp norms on unrelated machines.

### Online Node-Weighted Steiner Forest and Extensions via Disk Paintings

• Mathematics, Computer Science
2013 IEEE 54th Annual Symposium on Foundations of Computer Science
• 2013
The central idea in this technique is to amortize the cost of primal updates to a set of carefully selected mutually disjoint fixed-radius dual disks centered at a subset of terminals to form a new framework for online network design problems that is called disk paintings.

### Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling

• Computer Science
WAOA
• 2012
This analysis shows that competitive algorithms exist for problems that had resisted analysis using the dominant potential function approach in the speed-scaling literature, and provides alternate cleaner analysis for other known results.

### Towards the randomized k-server conjecture: a primal-dual approach

• Computer Science, Mathematics
SODA '10
• 2010
Recently, Coté et al. [10] proposed an approach for solving the k-server problem on Hierchically Separated Trees (HSTs). In particular, they define a problem on a uniform metric, and show that if an

### The competitiveness of on-line assignments

• Mathematics, Computer Science
SODA '92
• 1992
It is concluded that for the on-line problem where a number of servers are ready to provide service to a set of customers, randomized algorithms differ from deterministic ones by precisely a constant factor.