首页 | 本学科首页   官方微博 | 高级检索  
     检索      


A kind of QP-free feasible method
Authors:Haiyan Zhang  Guojun Li  Hongluan Zhao
Institution:1. School of Mathematics, Shandong University, Jinan 250100, PR China;2. Department of Mathematics and Physics, Shandong Jiaotong University, Jinan 253023, PR China;3. School of Computer Science and Technology, Shandong Jianzhu University, Jinan 250101, PR China
Abstract:This paper is concerned with a kind of QP-free feasible algorithm which solves an inequality constrained nonlinear optimization problem. Under some weaker conditions than those in H. Qi, L. Qi, A New QP-free, globally convergent, locally superlinear convergent algorithm for inequality constrained optimization, SIAM J. Optim. 11 (2000) 113–132], we prove that the algorithm is implementable and globally convergent. Moreover, some numerical test results are given to indicate that the algorithm is quite promising.
Keywords:Constrained optimization  QP-free  Linear independence  Smoothing function  Convergence
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号