On minimum norm solutions
Author:
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Management Science and Operations Research,Control and Optimization
Link
http://link.springer.com/content/pdf/10.1007/BF00952828.pdf
Reference8 articles.
1. Cadzow, J. A.,Algorithm for the Minimum-Effort Control Problem, IEEE Transactions on Automatic Control, Vol. 16, pp. 60?63, 1971.
2. Cadzow, J. A.,A Finite Algorithm for the Minimum l ?-Solution to a System of Consistent Linear Equations, SIAM Journal on Numerical Analysis, Vol. 10, pp. 607?617, 1973.
3. Kolev, L.,Iterative Algorithm for the Minimum Fuel and Minimum Amplitude Problems for Linear Discrete Systems, International Journal of Control, Vol. 21, pp. 779?784, 1975.
4. Herman, G. T., andLent, A.,A Family of Iterative Quadratic Optimization Algorithms for Pairs of Inequalities, with Application in Diagnostic Radiology, Mathematical Programming Study, Vol. 9, pp. 15?29, 1978.
5. Lent, A., andCensor, Y.,Extensions of Hildreth's Row-Action Method for Quadratic Programming, SIAM Journal on Control and Optimization, Vol. 18, pp. 444?454, 1980.
Cited by 10 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A New Class of Minimum Norm Duality Theorems;SIAM Journal on Optimization;2009-01
2. The distance between two convex sets;Linear Algebra and its Applications;2006-07
3. An accurate iterative reconstruction algorithm for sparse objects: application to 3D blood vessel reconstruction from a limited number of projections;Physics in Medicine and Biology;2002-07-18
4. The Smallest Correction of an Inconsistent System of Linear Inequalities;Optimization and Engineering;2001
5. Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming;Mathematical Programming;1998-03
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3