2009
DOI: 10.1007/s10957-009-9634-0
|View full text |Cite
|
Sign up to set email alerts
|

Improved Full-Newton Step O(nL) Infeasible Interior-Point Method for Linear Optimization

Abstract: We present several improvements of the full-Newton step infeasible interior-point method for linear optimization introduced by Roos (SIAM J. Optim. 16(4): 2006). Each main step of the method consists of a feasibility step and several centering steps. We use a more natural feasibility step, which targets the μ + -center of the next pair of perturbed problems. As for the centering steps, we apply a sharper quadratic convergence result, which leads to a slightly wider neighborhood for the feasibility steps. More… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2013
2013
2015
2015

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 19 publications
(8 citation statements)
references
References 11 publications
0
8
0
Order By: Relevance
“…Subsequently, Gu et al [19] proposed an improved version of full Newton-step infeasible IPM for LO where the convergence analysis of the algorithm was simplified. However, it still maintains the currently best known iteration bound.…”
Section: Introductionmentioning
confidence: 99%
“…Subsequently, Gu et al [19] proposed an improved version of full Newton-step infeasible IPM for LO where the convergence analysis of the algorithm was simplified. However, it still maintains the currently best known iteration bound.…”
Section: Introductionmentioning
confidence: 99%
“…2, we measure the proximity to the μ-center of the perturbed problems by the quantity σ (x, s; μ) as defined in (6). So, initially we have σ (x, s; μ) = 0, due to (11). In the sequel, we assume that at the start of each iteration, just before a μ-update, σ (x, s; μ) is smaller than or equal to a (small) threshold value τ > 0.…”
Section: An Iteration Of Our Algorithmmentioning
confidence: 99%
“…Mansouri et al [9,10] extended this algorithm on semidefinite optimization and linear complementarity problems (LCPs). Gu et al presented an improved IIPM for LO in [11]. In all of the mentioned works, the authors proposed algorithms with one feasibility step and several centering steps to get an optimal solution of underlying problems.…”
mentioning
confidence: 99%
“…In order to get a tight approximation for this value, we first need to estimate d f x . This is done in the next section, where we follow a similar approach as in [15].…”
Section: For Each Coordinate V I Of V We Have |ψ (V Min )|/2 ≤ ∇ψ (V)mentioning
confidence: 99%