A non-monotone line search multidimensional filter-SQP method for general nonlinear programming

In this paper, we propose a non-monotone line search multidimensional filter-SQP method for general nonlinear programming based on the Wächter–Biegler methods for nonlinear equality constrained programming. Under mild conditions, the global convergence of the new method is proved. Furthermore, with...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Numerical algorithms Ročník 56; číslo 4; s. 537 - 559
Hlavní autoři: Gu, Chao, Zhu, Detong
Médium: Journal Article
Jazyk:angličtina
Vydáno: Boston Springer US 01.04.2011
Springer Nature B.V
Témata:
Algebra
Algorithms
Computer Science
Constraints
Convergence
Mathematical models
Nonlinear programming
Nonlinearity
Numeric Computing
Numerical Analysis
Original Paper
Programming
Searching
Theory of Computation
Line search
General nonlinear programming
65K05
90C30
90C55
Multidimensional filter
Maratos effect
49M37
Non-monotone
Convergence
ISSN:1017-1398, 1572-9265
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper, we propose a non-monotone line search multidimensional filter-SQP method for general nonlinear programming based on the Wächter–Biegler methods for nonlinear equality constrained programming. Under mild conditions, the global convergence of the new method is proved. Furthermore, with the non-monotone technique and second order correction step, it is shown that the proposed method does not suffer from the Maratos effect, so that fast local convergence to second order sufficient local solutions is achieved. Numerical results show that the new approach is efficient.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1017-1398
1572-9265
DOI:10.1007/s11075-010-9403-z