SQP problem;
value function;
global error bound;
convergence;
D O I:
暂无
中图分类号:
T [工业技术];
学科分类号:
08 ;
摘要:
For the constrained optimization problem, under the condition that the objective function is strongly convex, we obtain a global error bound for the distance between any feasible solution and the optimal solution by using the merit function in the sequential quadratic programming (SQP) method.
机构:
Linyi Teachers Univ, Dept Math, Linyi 276005, Shandong, Peoples R ChinaQufu Normal Univ, Sch Operat Res & Management Sci, Rizhao 276800, Shandong, Peoples R China
Sun, H. C.
Wang, Y. J.
论文数: 0引用数: 0
h-index: 0
机构:
Qufu Normal Univ, Sch Operat Res & Management Sci, Rizhao 276800, Shandong, Peoples R ChinaQufu Normal Univ, Sch Operat Res & Management Sci, Rizhao 276800, Shandong, Peoples R China
Wang, Y. J.
Qi, L. Q.
论文数: 0引用数: 0
h-index: 0
机构:
Hong Kong Polytech Univ, Dept Appl Math, Kowloon, Hong Kong, Peoples R ChinaQufu Normal Univ, Sch Operat Res & Management Sci, Rizhao 276800, Shandong, Peoples R China
机构:
Hunan First Normal Univ, Coll Math & Computat Sci, Changsha 410205, Hunan, Peoples R ChinaHunan First Normal Univ, Coll Math & Computat Sci, Changsha 410205, Hunan, Peoples R China
Gao, Huan
Li, Yingyi
论文数: 0引用数: 0
h-index: 0
机构:
Hebei Finance Univ, Dept Basic Courses, Baoding 071051, Hebei, Peoples R ChinaHunan First Normal Univ, Coll Math & Computat Sci, Changsha 410205, Hunan, Peoples R China
Li, Yingyi
Zhang, Haibin
论文数: 0引用数: 0
h-index: 0
机构:
Beijing Univ Technol, Coll Appl Sci, Beijing 100124, Peoples R ChinaHunan First Normal Univ, Coll Math & Computat Sci, Changsha 410205, Hunan, Peoples R China