An algorithm for finding a vector in the intersection of open convex polyhedral cones-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

An algorithm for finding a vector in the intersection of open convex polyhedral cones

Published:1973-03 Issue:1 Volume:13 Page:114-119
ISSN:0006-3835
Container-title:BIT
language:en
Short-container-title:BIT

Author:

Storøy Sverre

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Mathematics,Computer Networks and Communications,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01933529.pdf

Reference3 articles.

1. J. C. G. Boot,Quadratic Programming, North-Holland Publishing Company, Amsterdam, 1964.

2. M. Boyer, S. Storøy and S. Thore,Equilibrium Returns in Capital Market Networks, to be published.

3. O. L. Mangasarian,Nonlinear Programming, McGraw-Hill Book Company, 1969.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An algorithm for least distance programming;BIT;1980-03

2. An algorithm to decide if the intersection of convex polyhedral cones has a non empty interior;BIT;1976-12

3. EQUILIBRIUM IN LINEAR CAPITAL MARKET NETWORKS;The Journal of Finance;1975-12

4. Decomposed enumeration of extreme points in the linear programming problem;BIT;1975-06

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP