A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems
Author:
Publisher
Society for Industrial & Applied Mathematics (SIAM)
Subject
Theoretical Computer Science,Software
Link
http://epubs.siam.org/doi/pdf/10.1137/S1052623498336590
Reference32 articles.
1. Combining Interior-Point and Pivoting Algorithms for Linear Programming
2. Basis- and partition identification for quadratic programming and linear complementarity problems
3. Sensitivity theorems in integer linear programming
4. Sufficient matrices and the linear complementarity problem
5. The linear complimentarity problem, sufficient matrices, and the criss-cross method
Cited by 28 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the complexity of analyticity in semi-definite optimization;Advances in Applied Mathematics;2024-05
2. Sufficient Matrices: Properties, Generating and Testing;Journal of Optimization Theory and Applications;2023-08-17
3. Unified Approach of Interior-Point Algorithms for $$P_*(\kappa )$$-LCPs Using a New Class of Algebraically Equivalent Transformations;Journal of Optimization Theory and Applications;2023-06-09
4. Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation;EURO Journal on Computational Optimization;2023
5. Refining the partition for multifold conic optimization problems;Optimization;2020-10-21
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3