Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming
Author:
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics
Link
http://link.springer.com/article/10.1007/s11075-018-0469-3/fulltext.html
Reference35 articles.
1. Wright, S.: Primal-Dual Interior-Point Methods. SIAM, Philadelphia (1997)
2. Mehrotra, S.: On the implementation of a primal-dual interior point method. SIAM J. Optim. 2, 575–601 (1992)
3. Lustig, I., Marsten, R., Shannon, D.: Computational experience with a primal-dual interior-point method for linear programming. Linear Algebra Appl. 152, 191–222 (1991)
4. Lustig, I., Marsten, R., Shannon, D.: On implementing Mehrotra’s predictor-corrector interior-point method for linear programming. SIAM J. Optim. 2, 432–449 (1992)
5. Monteiro, R., Adler, I., Resende, M.: A polynomial-time primal-dual affine scaling algorithm for linear and convex quadratic programming and its power series extension. Math. Oper. Res. 15, 191–214 (1990)
Cited by 9 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming;Computational Optimization and Applications;2022-07-06
2. A polynomial time infeasible interior-point arc-search algorithm for convex optimization;Optimization and Engineering;2022-03-31
3. An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints;Numerical Algorithms;2022-03-19
4. A Polynomial-Iteration Infeasible Interior-Point Algorithm with Arc-Search for Semidefinite optimization;Journal of Scientific Computing;2021-08-13
5. An infeasible interior-point arc-search algorithm for nonlinear constrained optimization;Numerical Algorithms;2021-05-18
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3