...
首页> 外文期刊>Journal of Computational Mathematics >Regular Splitting and potential Reduction Method for Solving Quadratic Programming Problem with Box Constraints
【24h】

Regular Splitting and potential Reduction Method for Solving Quadratic Programming Problem with Box Constraints

机译:求解带盒约束的二次规划问题的正则分解和势能减少方法

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

摘要

A regular splitting and potential reduction method is presented for solving a quadratic programming problem with box constraints (QPB) in this paper. A general algorithm is designed to solve the QPB problem and generate a sequence of iterative points. We show that the number of iterations to generate an ∈-minimum solution or an ∈-KKT solution by the algorithm is founded by O(n~2/∈ long 1/∈+nolg(1+/2n)), and the total running time is bounded by O(n~2(n+logn+log 1/∈)(n/∈ log /1∈+logn)) arithmetic operations.
机译:本文提出了一种规则分裂和势能减少的方法来解决带盒约束的二次规划问题。设计了一种通用算法来解决QPB问题并生成一系列迭代点。我们证明了通过算法生成O最小解或KKT解的迭代次数由O(n〜2 /∈long 1 /∈+ nolg(1 + / 2n))求和运行时间以O(n〜2(n + logn + log 1 /∈)(n /∈log /1∈+ logn))算术运算为界。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号