CSpace
二次规划的直接椭球算法
吴士泉1; 郭田德2
1996
Source Publication系统科学与数学
ISSN1000-0577
Volume016Issue:001Pages:1
Abstract本文对凸二次规划问题,给出了一个直接椭球算法,并证明了算法的复杂度为O(n^4L)。
Language英语
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/40307
Collection中国科学院数学与系统科学研究院
Affiliation1.中国科学院数学与系统科学研究院
2.青岛大学
Recommended Citation
GB/T 7714
吴士泉,郭田德. 二次规划的直接椭球算法[J]. 系统科学与数学,1996,016(001):1.
APA 吴士泉,&郭田德.(1996).二次规划的直接椭球算法.系统科学与数学,016(001),1.
MLA 吴士泉,et al."二次规划的直接椭球算法".系统科学与数学 016.001(1996):1.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[吴士泉]'s Articles
[郭田德]'s Articles
Baidu academic
Similar articles in Baidu academic
[吴士泉]'s Articles
[郭田德]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[吴士泉]'s Articles
[郭田德]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.