报告主题：具有凸约束的二次规划问题凸性 与解的存在性
报告人： 简金宝 教授（玉林师范学院）
报告时间：2016年6月3日（周五）16:00
报告地点：校本部G508
邀请人：白延琴教授
主办部门：古天乐代言太阳集团数学系
报告摘要：Abstract: Sequential quadratic programming (SQP) algorithm is very effective approach for solving constrained nonlinear programming. The search direction at each iteration of an SQP algorithm is usually generated by solving one or more quadratic programming (QP) problems with closed convex constraints. Therefore, a significant problem is that, under what weak and easily to be used conditions, the convexity and solution existence of a QP can be are guaranteed. In this paper, we present several such conditions for the (strict) convexity and solution existence of a kind of QP problems.
欢迎教师、学生参加 ！
