摘要
Thispaperrepresentsaninexactsequentialquadraticprogramming(SQP)algorithmwhichcansolvenonlinearprogramming(NLP)problems.Aninexactsolutionofthequadraticprogrammingsubproblemisdeterminedbyaprojectionandcontractionmethodsuchthatonlymatrix-vectorproductisrequired.SometruncatedcriteriaarechosensuchthatthealgorithmissuitabletolargescaleNLPproblem.Theglobalconvergenceofthealgorithmisproved.
出版日期
2002年01月11日(中国期刊网平台首次上网日期,不代表论文的发表时间)