首页 | 本学科首页   官方微博 | 高级检索  
     


A polynomial arc-search interior-point algorithm for convex quadratic programming
Authors:Yaguang Yang
Affiliation:1. Institute of Operational Research and Cybernetics, Hangzhou Dianzi University, Hangzhou, 310018, China;2. School of Electrical and Electronic Engineering, The University of Adelaide, SA 5005, Australia;3. College of Engineering and Science, Victoria University, Melbourne, VIC 8001, Australia;4. Graduate School of Science and Technology, Tokai University, 9-1-1, Toroku, Kumamoto 862–8652, Japan
Abstract:
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号