• Corpus ID: 16419006

Online Convex Covering and Packing Problems

@article{Chan2015OnlineCC,
  title={Online Convex Covering and Packing Problems},
  author={T-H. Hubert Chan and Zhiyi Huang and Ning Kang},
  journal={ArXiv},
  year={2015},
  volume={abs/1502.01802}
}
We study the online convex covering problem and online convex packing problem. The (offline) convex covering problem is modeled by the following convex program: $\min_{x \in R_+^n} f(x) \ \text{s.t}\ A x \ge 1$, where $f : R_+^n \mapsto R_+$ is a monotone and convex cost function, and $A$ is an $m \times n$ matrix with non-negative entries. Each row of the constraint matrix $A$ corresponds to a covering constraint. In the online problem, each row of $A$ comes online and the algorithm must… 

Online covering with $$\ell _q$$ℓq-norm objectives and applications to network design

TLDR
An improved online algorithm for non-uniform buy-at-bulk network design and a poly-logarithmic competitive ratio for throughput maximization under ℓp-norm capacities are obtained.

Online Covering with Sum of $\ell_q$-Norm Objectives

TLDR
Improved online algorithms for non-uniform buy-at-bulk network design and the first online algorithm for throughput maximization under $\ell_p$-norm edge capacities are obtained.

Online Algorithms for Covering and Packing Problems with Convex Objectives

TLDR
A primal-dual approach is used to give online algorithms for covering and packing problems with (non-linear) convex objectives, and these algorithms are used to simplify, unify, and improve upon previous results for several applications.

Worst Case Competitive Analysis of Online Algorithms for Conic Optimization

TLDR
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

TLDR
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.

Covering with Sum of l q-Norm Objectives

TLDR
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.

Function Design for Improved Competitive Ratio in Online Resource Allocation with Procurement Costs

TLDR
This work analyzes the competitive ratio of a primal-dual algorithm in this setting, develops an optimization framework for synthesizing a surrogate function for the procurement cost function to be used by the algorithm, and develops a posted pricing mechanism in which the algorithm does not require the customers’ preferences to be revealed.

A Single Recipe for Online Submodular Maximization with Adversarial or Stochastic Constraints

TLDR
The results not only improve upon the existing bounds under linear cumulative constraints, but also give the first sub-linear bounds for general convex long-term constraints.

Online Energy Storage Management: an Algorithmic Approach

TLDR
This work designs poly-logarithmic competitive algorithms in the network flow model using the dual fitting and online primal dual methods for convex problems for online energy storage management problems and shows strong hardness results for more general settings of the problem.

Online algorithm design via smoothing with application to online experiment selection

TLDR
This dissertation presents the results of the research on the design and analysis of online convex optimization algorithms, convergence rate analysis of proximal gradient homotopy algorithm for structured convex problems, and application of computational methods for study of brain cells in the visual cortex of the primate brain.

References

SHOWING 1-10 OF 22 REFERENCES

Online Packing and Covering Framework with Convex Objectives

TLDR
Using this fractional solver with problem-dependent randomized rounding procedures, competitive algorithms are obtained for the following problems: online covering LPs minimizing $\ell_p$-norms of arbitrary packing constraints, set cover with multiple cost functions, capacity constrained facility location, capacitated multicast problem, setCover with set requests, and profit maximization with non-separable production costs.

Online Covering with Convex Objectives and Applications

TLDR
This work gives an algorithmic framework for minimizing general convex objectives over a set of covering constraints that arrive online and adapts the two-phase approach of obtaining a fractional solution and then rounding it online to the non-linear objective.

Approximating Sparse Covering Integer Programs Online

TLDR
The previous approaches, which either only raise dual variables, or lower duals only within a guess-and-double framework, cannot give a performance better than O(logn), even when each constraint only has a single variable.

Online Primal-Dual Algorithms for Covering and Packing

TLDR
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.

Online Mixed Packing and Covering

TLDR
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.

Welfare Maximization with Production Costs: A Primal Dual Approach

TLDR
It is shown that online posted pricing mechanisms, which are incentive compatible, can achieve competitive ratios arbitrarily close to the optimal, and construct lower bound instances on which no online algorithms, not necessarily incentivecompatible, can do better.

Online Set Cover with Set Requests

We consider a generic online allocation problem that generalizes the classical online set cover framework by considering requests comprising a set of elements rather than a single element. This

Randomized Primal-Dual analysis of RANKING for Online BiPartite Matching

TLDR
This is the first instance of a non-trivial randomized primal-dual algorithm in which the dual constraints only hold in expectation.

Welfare and Profit Maximization with Production Costs

TLDR
This work begins the study of the algorithmic mechanism design problem of combinatorial pricing under increasing marginal cost, and gives algorithms that achieve constant factor approximations for a class of natural cost functions -- linear, low-degree polynomial, logarithmic -- and that give logariths for more general increasingmarginal cost functions.

SIGACT News Online Algorithms Column 25: Online Primal Dual: Beyond Linear Programs

TLDR
This paper will talk about some recent research on extending the online primal dual technique beyond linear programs, and focused on convex programs and Fenchel duality in the nonstochastic setting.