An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity

In this paper, a kind of nonlinear optimization problems with nonlinear inequality constraints are discussed, and a new SQP feasible descent algorithm for solving the problems is presented. At each iteration of the new algorithm, a convex quadratic program (QP) which always has feasible solution is...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Computers & mathematics with applications (1987) Ročník 49; číslo 2; s. 223 - 238
Hlavní autori:	Jian, Jin-Bao, Tang, Chun-Ming
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Ltd 2005
Predmet:	Algorithms Constrained Optimization Constraints Descent Feasible Descent Algorithm Inequalities Mathematical analysis Mathematical models Nonlinear Inequality Nonlinearity Optimization SQP Superlinear Convergence Nonlinear Inequality Feasible Descent Algorithm SQP Superlinear Convergence Constrained Optimization
ISSN:	0898-1221, 1873-7668
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!