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...

Full description

Saved in:

Bibliographic Details
Published in:	Computers & mathematics with applications (1987) Vol. 49; no. 2; pp. 223 - 238
Main Authors:	Jian, Jin-Bao, Tang, Chun-Ming
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 2005
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!