A nonmonotone SQP-filter method for equality constrained optimization

In this paper, we propose a nonmonotone sequential quadratic programming-filter method for solving nonlinear equality constrained optimization. This new method has more flexibility for the acceptance of the trial step and requires less computational costs compared with the monotone methods. Under re...

Full description

Saved in:
Bibliographic Details
Published in:International journal of computer mathematics Vol. 87; no. 15; pp. 3489 - 3506
Main Authors: Gu, Chao, Zhu, Detong
Format: Journal Article
Language:English
Published: Abingdon Taylor & Francis 01.12.2010
Taylor & Francis Ltd
Subjects:
Acceptance
Algorithms
Computational efficiency
Computational mathematics
Computer simulation
Constraints
Convergence
filter method
Flexibility
line search
Maratos effect
Mathematical models
Nonlinear equations
nonmonotone
Optimization
Optimization algorithms
ISSN:0020-7160, 1029-0265
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we propose a nonmonotone sequential quadratic programming-filter method for solving nonlinear equality constrained optimization. This new method has more flexibility for the acceptance of the trial step and requires less computational costs compared with the monotone methods. Under reasonable conditions, we give the global convergence properties. Further, the second-order correction step and nonmonotone reduction conditions are used to overcome Maratos effect so that quadratic local convergence is achieved. The numerical experiments are reported to show the effectiveness of the proposed algorithm.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0020-7160
1029-0265
DOI:10.1080/00207160903124942