首页> 外文会议>The 8th international conference on optimization: Techniques and Applications >Convergence properties of inexact sequential quadratically constrained quadratic programming method for convex programming
【24h】

Convergence properties of inexact sequential quadratically constrained quadratic programming method for convex programming

机译:凸规划的不精确序次二次约束二次规划方法的收敛性。

获取原文
获取原文并翻译 | 示例

摘要

This paper is concerned with a sequential quadratically constrained quadratic programming (SQCQP) method for convex programming. The SQCQP method solves at each iteration a quadratically constrained quadratic programming subproblem whose objective function and constraints are quadratic approximations of the objective function and constraints of the original problem, respectively. We propose an inexact SQCQP method which solves inexactly the subproblem and prove its global and superlinear convergence properties.
机译:本文涉及一种用于凸规划的顺序二次约束二次规划(SQCQP)方法。 SQCQP方法在每次迭代时求解二次约束二次规划子问题,其目标函数和约束分别是目标函数和原始问题的约束的二次近似。我们提出了一种不精确的SQCQP方法,该方法可以精确地解决子问题并证明其全局和超线性收敛性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号