A Reflective Newton Method for Minimizing a Quadratic Function Subject to Bounds on Some of the Variables
Author:
Publisher
Society for Industrial & Applied Mathematics (SIAM)
Subject
Theoretical Computer Science,Software
Link
http://epubs.siam.org/doi/pdf/10.1137/S1052623494240456
Reference26 articles.
1. A direct method for sparse least squares problems with lower and upper bounds
2. Approximate solution of the trust region problem by minimization over two-dimensional subspaces
3. A direct active set algorithm for large sparse quadratic programs with simple bounds
4. A Globally and Superlinearly Convergent Algorithm for Convex Quadratic Programs with Simple Bbounds
Cited by 433 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Efficient parameter estimation in biochemical pathways: Overcoming data limitations with constrained regularization and fuzzy inference;Expert Systems with Applications;2025-01
2. Inverse Design Method for Horn Antennas Based on Knowledge-Embedded Physics-Informed Neural Networks;IEEE Antennas and Wireless Propagation Letters;2024-06
3. Introducing a Priori Information With Variable Changes for a Two-Parameter Reconstruction From Experimental Fresnel Institute Electromagnetic Data;IEEE Antennas and Wireless Propagation Letters;2024-06
4. Global system errors to simultaneously improve the identification of subsystems with mixed data Gaussian process regression;Machine Learning: Science and Technology;2024-05-30
5. A simulation on hierarchical wavefront control for large aperture lightweight polymer mirrors;Sixth Conference on Frontiers in Optical Imaging and Technology: Novel Technologies in Optical Systems;2024-04-30
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3