Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 0872.90067
Auslender, A.; Cominetti, R.; Haddou, M.
Asymptotic analysis for penalty and barrier methods in convex and linear programming. (English)
[J] Math. Oper. Res. 22, No.1, 43-62 (1997). ISSN 1526-5471; ISSN 0364-765X/e

Summary: We consider a wide class of penalty and barrier methods for convex programming which includes a number of specific functions proposed in the literature. We provide a systematic way to generate penalty and barrier functions in this class, and we analyze the existence of primal and dual optimal paths generated by these penalty methods, as well as their convergence to the primal and dual optimal sets. For linear programming we prove that these optimal paths converge to single points.

MSC 2000:: *90C25 Convex programming
90C05 Linear programming
90C31 Sensitivity, etc.

Keywords: penalty and barrier methods; existence of primal and dual optimal paths

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.

Advanced Search

Zentralblatt MATH Berlin [Germany]