.png){kind=icon}
返回
A two-phase algorithm for the multiparametric linear complementarity problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2016.04.043.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A new two-phase method for solving the multi-parametric linear complementarity problem (mpLCP) with sufficient matrices is presented. In the first phase an initial feasible solution to mpLCP which satisfies certain criteria is determined. In the second phase the set of feasible parameters is partitioned into polyhedral regions such that the solution of the mpLCP, as a function of the parameters, is invariant over each region. The worst-case complexity of the presented algorithms matches that of current methods for nondegenerate problems and is lower than that of current methods for degenerate problems. (C) 2016 Elsevier B.V. All rights reserved.
Keyword:
Convex programming
Multiparametric optimization
Linear complementarity problem
Two-phase method
Sufficient matrix
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
Cardiac abnormalities in ischemic cerebrovascular disease studied by two-dimensional echocardiography..png)
Stroke
StrokeIF0
PREAI
分享收藏Heterocyclic Ring-Closure Reactions; VII1. A Facile Synthesis of 5-Imino-4-oxazolidinethiones and 4-Thioxo-5-oxazolidinonesSynthesis
SynthesisIF0
PREAI
分享收藏Enumeration-based approach to solving parametric linear complementarity problems基于枚举的参数线性互补问题求解方法AUTOMATICA
AUTOMATICAIF5.9
PREAI
分享收藏
Large-scale MV efficient frontier computation via a procedure of parametric quadratic programming
PREAI
分享收藏
查看更多内容