Chinese Quarterly Journal of Mathematics ›› 2009, Vol. 24 ›› Issue (3): 469-474.

Previous Articles    

Feasible SQP Descent Method for Inequality Constrained Optimization Problems and Its Convergence 

  

  1. 1. Department of Mathematics, Luohe Vocational Technology College2. Department of Mathematics, Jiaozuo Teachers College
  • Received:2009-03-10 Online:2009-09-30 Published:2023-07-03
  • About author:ZHANG He-ping(1965- ), male, native of Hebi, Henan, an associate professor of Luohe Vocational Technology College, M.S.D., engages in nonlinear programming; YE Liu-qing(1965- ), male, native of Runan, Henan, a professor of Jiaozuo Teachers College, M.S.D., engages in nonlinear programming.
  • Supported by:
     Supported by the NNSF of China(10231060); Supported by the Soft Science Foundation of Henan Province(082400430820);

Abstract: In this paper, the new SQP feasible descent algorithm for nonlinear constrained optimization problems presented, and under weaker conditions of relative, we proofed the new method still possesses global convergence and its strong convergence. The 

Key words: nonlinearly constrained optimization, SQP, the generalized projection, line
search,
global convergence, strong convergence.

CLC Number: