2002
DOI: 10.1137/s1052623401398132
|View full text |Cite
|
Sign up to set email alerts
|

A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier

Abstract: We introduce a new barrier function which is not a barrier function in the usual sense: it has finite value at the boundary of the feasible region. Despite this, its iteration bound, O √ n log n log n ε , is as good as it can be: it is the best known bound for large-update methods. The recently introduced notions of superconvexity and exponential convexity are crucial in the analysis.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
59
0

Year Published

2008
2008
2022
2022

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 103 publications
(60 citation statements)
references
References 16 publications
1
59
0
Order By: Relevance
“…√ n log n log n ε ) complexity which is similar to the one in [1] which is so far the best known complexity for large-update IPM. In [1], they analyzed the complexity bound of the algorithm for LO based on all eligible conditions.…”
Section: Introductionmentioning
confidence: 66%
See 3 more Smart Citations
“…√ n log n log n ε ) complexity which is similar to the one in [1] which is so far the best known complexity for large-update IPM. In [1], they analyzed the complexity bound of the algorithm for LO based on all eligible conditions.…”
Section: Introductionmentioning
confidence: 66%
“…We denote the solution of (2) as (x(µ), s(µ)) for given µ > 0. We also call it µ-center for given µ and the solution set {(x(µ), s(µ)) | µ > 0} the central path for system (1). Note that the sequence (x(µ), s(µ)) approaches to the solution (x, s) of the system (1) as µ → 0 ( [7]).…”
Section: Preliminariesmentioning
confidence: 99%
See 2 more Smart Citations
“…Following the terminology introduced in [5][6][7], we call the univariate function ψ(t) the kernel function of the barrier function (v). Obviously, in the case (6) to find x and s. They can also be obtained directly by solving the following system:…”
Section: -Center (X(μ) S(μ))mentioning
confidence: 99%