A feasible descent SQP algorithm for general constrained optimization without strict complementarity

In this paper, a class of optimization problems with equality and inequality constraints is discussed. Firstly, the original problem is transformed to an associated simpler problem with only inequality constraints and a parameter. The later problem is shown to be equivalent to the original problem i...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of computational and applied mathematics Vol. 180; no. 2; pp. 391 - 412
Main Authors:	Jian, Jin-Bao, Tang, Chun-Ming, Hu, Qing-Jie, Zheng, Hai-Yan
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 15.08.2005 Elsevier
Subjects:	Calculus of variations and optimal control Exact sciences and technology Feasible descent algorithm General constrained optimization Mathematical analysis Mathematics Numerical analysis Numerical analysis. Scientific computation Numerical methods in mathematical programming, optimization and calculus of variations Sciences and techniques of general use SQP Strict complementarity Superlinear convergence General constrained optimization 49M30 90C30 SQP Superlinear convergence Feasible descent algorithm Strict complementarity Optimization method 49M30 General constrained optimization Numerical method Convergence Constrained optimization Numerical analysis Applied mathematics Inequality constraint Equality constraint Mathematical programming
ISSN:	0377-0427, 1879-1778
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!