Primal-dual feasible interior point algorithm for convex quadratic programming (EI收录) | |
Longquan, Yong[1] | |
会议名称 | Proceedings of the 2nd International Conference on Modelling and Simulation, ICMS2009 |
会议日期 | May 21, 2009 - May 22, 2009 |
会议地点 | Manchester, United kingdom |
关键词 | Algorithms Numerical analysis Optimization Polynomials |
URL标识 | 查看原文 |
内容类型 | 会议论文 |
URI标识 | http://www.corc.org.cn/handle/1471x/2081459 |
专题 | 华南理工大学 |
作者单位 | [1] Department of Mathematics, Shaanxi University of Technology, Hanzhong 723001, China |
推荐引用方式 GB/T 7714 | Longquan, Yong[1]. Primal-dual feasible interior point algorithm for convex quadratic programming (EI收录)[C]. 见:Proceedings of the 2nd International Conference on Modelling and Simulation, ICMS2009. Manchester, United kingdom. May 21, 2009 - May 22, 2009. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论