2009
DOI: 10.1137/060649513
|View full text |Cite
|
Sign up to set email alerts
|

Adaptive Barrier Update Strategies for Nonlinear Interior Methods

Abstract: This paper considers strategies for selecting the barrier parameter at every iteration of an interior-point method for nonlinear programming. Numerical experiments suggest that heuristic adaptive choices, such as Mehrotra's probing procedure, outperform monotone strategies that hold the barrier parameter fixed until a barrier optimality test is satisfied. A new adaptive strategy is proposed based on the minimization of a quality function. The paper also proposes a globalization framework that ensures the conve… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
67
0
2

Year Published

2010
2010
2019
2019

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 90 publications
(70 citation statements)
references
References 26 publications
1
67
0
2
Order By: Relevance
“…changing the initial value of some parameters and especially the barrier parameter, using a less aggressive decrease of the barrier parameter, using an alternative interior-point algorithm, etc.) [16,40], but they take additional computational effort without guaranteeing solution restoration.…”
Section: Discussion Conclusion and Perspectivesmentioning
confidence: 99%
See 1 more Smart Citation
“…changing the initial value of some parameters and especially the barrier parameter, using a less aggressive decrease of the barrier parameter, using an alternative interior-point algorithm, etc.) [16,40], but they take additional computational effort without guaranteeing solution restoration.…”
Section: Discussion Conclusion and Perspectivesmentioning
confidence: 99%
“…Furthermore, the convergence is not restored even after trying few classical heuristic techniques (e.g. different initial values for the barrier parameter , smaller values of the safety parameter , and different initializations of variables) [16,40]. However, by using another IPM algorithm, namely the predictor-corrector (that we generally found slightly less reliable than the MCC algorithm) a locally optimal solution is found.…”
Section: Opf Failure On a Very Tough Problemmentioning
confidence: 99%
“…[43]), where the barrier parameter is fixed until an approximate solution of (64) has been obtained, and there is a variety of dynamic update strategies (cf. [12,36,48,84,96,97,98]). Convergence properties of the Fiacco-McCormick approach have been studied in [28] and [100], whereas a convergence analysis of dynamic update strategies has been addressed in [12,36,84,97].…”
Section: Path-following Barrier Methodsmentioning
confidence: 99%
“…X * satisfies K(X * , 0) = 0. It is important to note that, for = 0, exact (X) is the equivalent of quality function in [26].…”
Section: Optimal Centering Parametermentioning
confidence: 99%
“…If the number of corrections less than Step 5. According to (26), update the iteration point by using ΔΧ, and , = + 1, goto Step 1.…”
Section: Algorithm Improved Ipm (I-ipm)mentioning
confidence: 99%