| 凸二次规划问题基于核函数的全牛顿步内点算法 |
| |
| 引用本文： | 汪威威,毕红梅,马飞.凸二次规划问题基于核函数的全牛顿步内点算法[J].咸阳师范专科学校学报,2013(6):1-3. |
| |
| 作者姓名： | 汪威威 毕红梅 马飞 |
| |
| 作者单位： | [1]西安工业大学理学院,陕西西安710032 [2]空军工程大学理学院,陕西西安710051 [3]咸阳师范学院数学与信息科学学院,陕西咸阳712000 |
| |
| 基金项目： | 陕西省教育厅科研基金项目（2010JK890）. |
| |
| 摘 要： | 针对凸二次规划问题,构造了新的核函数.通过构造的核函数来确定搜索方向和逼近度量,接着给出了求解凸二次规划问题的全牛顿步内点算法,最后给出了算法的复杂性界.
|
| 关 键 词： | 凸二次规划问题 内点算法 全牛顿步 核函数 |
A Full-Newton Step Interior-point Algorithm Based on a Kernel Function for Convex Quadratic Optimization |
| |
| WANG Wei-wei,BI Hong-mei,MA Fei.A Full-Newton Step Interior-point Algorithm Based on a Kernel Function for Convex Quadratic Optimization[J].Journal of Xianyang Teachers College,2013(6):1-3. |
| |
| Authors: | WANG Wei-wei BI Hong-mei MA Fei |
| |
| Institution: | 1. College of Science, Xi＇ an Technological University, Xi＇ an 710032, Shaanxi,China;2. College of Science, Air Force Engineering University,Xi＇ an 710051, Shaanxi ,China;3. College of Mathematics and Information Science, Xianyang Normal University, Xianyang 712000, Shaanxi,China) |
| |
| Abstract: | For solving convex quadratic optimization, we introduce a new kernel function.Through the new kernel function, we derive a new search direction and proximity measure, then present a full-Netwon step interior-point algorithm. Finally, we prove that the complexity bound of the algorithm. |
| |
| Keywords: | convex quadratic optimization interior-point algorithm full-Newton step kernelfunction |
| 本文献已被 维普 等数据库收录！ |
|
