Simple Search

Query:

Enter a query and click »Search«...

Format:

Display: entries per page entries

Zbl 0857.90080
den Hertog, D.; Roos, C.; Terlaky, T.
(Hertog, D. den)
Inverse Barrier methods for linear programming. (English)
[J] RAIRO, Rech. Opér. 28, No.2, 135-163 (1994). ISSN 0399-0559

Summary: In the recent interior point methods for linear programming much attention has been given to the logarithmic barrier method. In this paper, we analyze the class of inverse barrier methods for linear programming, in which the barrier is $\sum x^{- r}_i$, where $r> 0$ is the rank of the barrier.\par There are many similarities with the logarithmic barrier method. The minima of an inverse barrier function for different values of the barrier parameter define a ``central path'' dependent on $r$, called the $r$-path of the problem. For $r\downarrow 0$ this path coincides with the central path determined by the logarithmic barrier function. We introduce a metric to measure the distance of a feasible point to a point on the path. We prove that in a certain region around a point on the path the Newton process converges quadratically. Moreover, outside this region, taking a step into the Newton direction decreases the barrier function value at least with a constant.\par We derive upper bounds for the total number of iterations needed to obtain an $\varepsilon$-optimal solution. Unfortunately, these bounds are not polynomial in the input length. Only if the rank $r$ goes to zero we get a polynomiality result, but then we are actually working with the logarithmic barrier method.

MSC 2000:: *90C05 Linear programming

Keywords: interior point methods; logarithmic barrier method; inverse barrier methods

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Simple Search

Zentralblatt MATH Berlin [Germany]