报告摘要：

  An interior-point trust-region algorithm is proposed for minimization of general (perhaps, non-convex) quadratic objective function over the domain obtained as the intersection of a symmetric cone with an affine subspace. The algorithm uses a trust-region model to ensure descent on a suitable merit function. Convergence to first-order and second-order optimality conditions is proved. Application to solve large-scale trust-region subproblem is presented.

报告时间： 2005年10月27日(周四) 下午4:00--5:00

报告地点：科技综合楼三层311报告厅