A Modified Algorithm of SQP Type
Received:January 22, 1993  
Key Words: general nonlinear programming, successive quadratic programming, exact penalty functions, rate of convergence.  
Fund Project:
Author NameAffiliation
Jian Jinbao Dept. of Math.,Guangxi University 
Hits: 2231
Download times: 2534
Abstract:
      This paper presents an algorithm of successive quadratic programming (SQP) type for programming problems with nonlinear equality and inequality constraints. Under some suitable conditions, we prove the global and superlinear convergence properties.
Citation:
DOI:10.3770/j.issn:1000-341X.1995.05.012
View Full Text  View/Add Comment  
  Copyright © Journal of Mathematical Research with Applications
Sponsored by：Dalian University of Technology, China Society for Industrial and Applied Mathematics
Address：No.2 Linggong Road, Ganjingzi District, Dalian City, Liaoning Province, P. R. China , Postal code ：116024
Service Tel：86-411-84707392 Email：jmre@dlut.edu.cn
Designed by Beijing E-tiller Co.,Ltd.
Due to security factors, early browsers cannot log in. It is recommended to log in with IE10, IE11, Google, Firefox, and 360 new browsers.