Advanced Search

Query:

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

Format:

Display: entries per page entries

Zbl 1038.90076
Fletcher, Roger; Gould, Nicholas I. M.; Leyffer, Sven; Toint, Philippe L.; Wächter, Andreas
Global convergence of a trust-region SQP-filter algorithm for general nonlinear programming. (English)
[J] SIAM J. Optim. 13, No. 3, 635-659 (2002). ISSN 1052-6234; ISSN 1095-7189/e

An SQP globally convergent algorithm for solving nonlinear $C^2$-optimization problems with equality and inequality constraints is presented. The algorithm is based on trust region methods where filters are used instead of penalty functions. The filter concept was introduced by {\it R. Flechter} and {\it S. Leyffer} [Nonlinear programming without a panelty function, Math. Program. 91, 239--269 (2002; Zbl 1049.90088)]. It aims to avoid steps that are no improvement w.r.t. feasibility and objective value. Another feature of the algorithm is that the steps of the quadratic trust region subproblems are viewed as the sum of a normal step (for satisfying the constraints) and a tangential step (for reducing the objective function model of the subproblem). Therefore it is not required that the solution of the quadratic subproblems are determinied exactly.
[H. Ratschek (Düsseldorf)]

MSC 2000:: *90C30 Nonlinear programming
65K05 Mathematical programming (numerical methods)
90C55 Methods of successive quadratic programming type

Keywords: nonlinear optimization; sequential quadratic programming; filter methods; convergence theory

Citations: Zbl 1049.90088

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]