Affiliation:
1. Univ. of California, Berkeley
2. IBM Almaden Research Center, San Jose, CA and Tel Aviv Univ., Tel Aviv, Israel
Abstract
It has been a challenge for mathematicians to confirm theoretically the extremely good performance of simplex-type algorithms for linear programming. In this paper the average number of steps performed by a simplex algorithm, the so-called
self-dual method
, is analyzed. The algorithm is not started at the traditional point (1, … , l)
T
, but points of the form (1, ϵ, ϵ
2
, …)
T
, with ϵ sufficiently small, are used. The result is better, in two respects, than those of the previous analyses. First, it is shown that the expected number of steps is bounded between two quadratic functions
c
1
(min(
m
,
n
))
2
and
c
2(min(
m
,
n
))
2
of the
smaller
dimension of the problem. This should be compared with the previous two major results in the field. Borgwardt proves an upper bound of
O
(
n
4
m
1/(
n
-1)
) under a model that implies that the zero vector satisfies all the constraints, and also the algorithm under his consideration solves only problems from that particular subclass. Smale analyzes the self-dual algorithm starting at (1, … , 1)
T
. He shows that for any fixed
m
there is a constant
c
(
m
) such the expected number of steps is less than
c
(
m
)(ln
n
)
m
(
m
+1)
; Megiddo has shown that, under Smale's model, an upper bound
C
(
m
) exists. Thus, for the first time, a polynomial upper bound with no restrictions (except for nondegeneracy) on the problem is proved, and, for the first time, a nontrivial lower bound of precisely the same order of magnitude is established. Both Borgwardt and Smale require the input vectors to be drawn from spherically symmetric distributions. In the model in this paper, invariance is required only under certain
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference19 articles.
1. ADLER i. The expected number of pivots needed to solve parametric linear programs and the efficiency of the self-dual simplex method. Dept. of Industrial Engineering and Operations Research Univ. of Calif. Berkeley Berkeley Calif. June 1983. ADLER i. The expected number of pivots needed to solve parametric linear programs and the efficiency of the self-dual simplex method. Dept. of Industrial Engineering and Operations Research Univ. of Calif. Berkeley Berkeley Calif. June 1983.
2. ADLER I. AND otmt~out:~ o. r__ . lX~muum llll~i;ll lJiU~ldlll~. T.-.-.h Ik~p. L/IkL O1- V~IdtlUll~ Research Center Univ. of Calif. Berkeley Berkeley Calif. 1981. ADLER I. AND otmt~out:~ o. r__ . lX~muum llll~i;ll lJiU~ldlll~. T.-.-.h Ik~p. L/IkL O1- V~IdtlUll~ Research Center Univ. of Calif. Berkeley Berkeley Calif. 1981.
3. ADLER I. AND BERENGUER S.E. Duality theory and the random generation of linear programs. Berkeley Calif. 198 I. ADLER I. AND BERENGUER S.E. Duality theory and the random generation of linear programs. Berkeley Calif. 198 I.
4. ADLER |. AND BERENGUER S.E. Generating random linear programs. Revised manuscript Dept. af lndn~trial Engineering and Ciperatinn~ Ragenrch Univ. of Calif Rerkeley Rarkelav Calif (1983). ADLER |. AND BERENGUER S.E. Generating random linear programs. Revised manuscript Dept. af lndn~trial Engineering and Ciperatinn~ Ragenrch Univ. of Calif Rerkeley Rarkelav Calif (1983).
Cited by
97 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
2. A Friendly Smoothed Analysis of the Simplex Method;SIAM Journal on Computing;2020-01
3. Efficiency of the Simplex Method;International Series in Operations Research & Management Science;2020
4. Data Science Applications;International Series in Operations Research & Management Science;2020
5. Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs;Mathematical Programming;2019-02-04