Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds

09/12/2019
by   Xiaocheng Li, et al.
0

We study an online linear programming (OLP) problem under a random input model in which the columns of the constraint matrix along with the corresponding coefficients in the objective function are generated i.i.d. from an unknown distribution and revealed sequentially over time. Virtually all current online algorithms were based on learning the dual optimal solutions/prices of the linear programs (LP), and their analyses were focused on the aggregate objective value and solving the packing LP where all coefficients in the constraint matrix and objective are nonnegative. However, two major open questions are: (i) Does the set of LP optimal dual prices of OLP converge to those of the "offline" LP, and (ii) Could the results be extended to general LP problems where the coefficients can be either positive or negative. We resolve these two questions by establishing convergence results for the dual prices under moderate regularity conditions for general LP problems. Then we propose a new type of OLP algorithm, Action-History-Dependent Learning Algorithm, which improves the previous algorithm performances by taking into account the past input data as well as and decisions/actions already made. We derive an O(log n loglog n) regret bound for the proposed algorithm, against the O(√(n)) bound for typical dual-price learning algorithms, and show that no dual-based thresholding algorithm achieves a worst-case regret smaller than O(log n), where n is the number of decision variables. Numerical experiments demonstrate the superior performance of the proposed algorithms and the effectiveness of our action-history-dependent design. Our results also indicate that, for solving online optimization problems with constraints, it's better to utilize a non-stationary policy rather than the stationary one.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/05/2020

Simple and Fast Algorithm for Binary Integer and Online Linear Programming

In this paper, we develop a simple and fast online algorithm for solving...
research
12/12/2019

A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix

Following the breakthrough work of Tardos in the bit-complexity model, V...
research
10/26/2020

Interior Point Solving for LP-based prediction+optimisation

Solving optimization problems is the key to decision making in many real...
research
09/18/2022

Online Regenerative Learning

We study a type of Online Linear Programming (OLP) problem that maximize...
research
02/18/2019

A Quantum IP Predictor-Corrector Algorithm for Linear Programming

We introduce a new quantum optimization algorithm for Linear Programming...
research
02/26/2017

Kiefer Wolfowitz Algorithm is Asymptotically Optimal for a Class of Non-Stationary Bandit Problems

We consider the problem of designing an allocation rule or an "online le...
research
12/24/2021

Robust Secretary and Prophet Algorithms for Packing Integer Programs

We study the problem of solving Packing Integer Programs (PIPs) in the o...

Please sign up or login with your details

Forgot password? Click here to reset