A new norm-relaxed SQP algorithm with global convergence

A new norm-relaxed sequential quadratic programming algorithm with global convergence for inequality constrained problem is presented in this paper, and the quadratic programming subproblem can be solved at each iteration. Without the boundedness assumptions on any of the iterative sequences, the gl...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Applied mathematics letters Ročník 23; číslo 6; s. 670 - 675
Hlavní autoři:	Zheng, Hai-Yan, Jian, Jin-Bao, Tang, Chun-Ming, Quan, Ran
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Kidlington Elsevier Ltd 01.06.2010 Elsevier
Témata:	[formula omitted] penalty function Algorithms Calculus of variations and optimal control Constraints Convergence Exact sciences and technology Global convergence Inequalities Iterative methods Mathematical analysis Mathematics Norm-relaxed SQP Numerical analysis Numerical analysis. Scientific computation Quadratic programming Sciences and techniques of general use Searching Norm-relaxed SQP l ∞ penalty function Global convergence Applied mathematics Sequential method penalty function Iterative method Iteration Quadratic programming l Algorithm Convergence
ISSN:	0893-9659, 1873-5452
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!

Buďte první, kdo okomentuje tento záznam!