Simple Search

Query:

Enter a query and click »Search«...

Format:

Display: entries per page entries

Zbl 0846.90109
Bonnans, J.Frédéric; Gonzaga, Clovis C.
Convergence of interior point algorithms for the monotone linear complementarity problem. (English)
[J] Math. Oper. Res. 21, No.1, 1-25 (1996). ISSN 1526-5471; ISSN 0364-765X/e

Summary: The literature on interior point algorithms shows impressive results related to the speed of convergence of the objective values, but very little is known about the convergence of the iterate sequences. This paper studies the horizontal linear complementarity problem, and derives general convergence properties for algorithms based on Newton iterations. This problem provides a simple and general framework for most existing primal-dual interior point methods. The conclusion is that most of the published algorithms of this kind generate convergent sequences. In many cases (whenever the convergence is not too fast in a certain sense), the sequences converge to the analytic center of the optimal face.

MSC 2000:: *90C33 Complementarity problems
49M15 Methods of Newton-Raphson, Galerkin and Ritz types
65K05 Mathematical programming (numerical methods)

Keywords: interior point algorithms; horizontal linear complementarity problem; general convergence properties; Newton iterations

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

	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]