ArcLP.m implements an O(\sqrt{n}L) arc-search infeasible interior-point algorithm for Linear Programming problems proposed in
[Y. Yang] Two computationally efficient polynomial-iteration
infeasible interior-point algorithms for linear programming
Numerical Algorithms, (2018) 79:957–992.
According to the numerical test reported in [Y. Yang], this algorithm is competitive to the popular Mehrotra's algorithm. Unlike Mehrotra's algorithm, arcLP.m searches the optimizer along an arc. Bug report should be sent to the author.
引用格式
Yaguang Yang (2024). arcLP (https://www.mathworks.com/matlabcentral/fileexchange/72340-arclp), MATLAB Central File Exchange. 检索来源 .
Y. Yang, Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming Numerical Algorithms, (2018) 79:957–992.
MATLAB 版本兼容性
平台兼容性
Windows macOS Linux类别
标签
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!版本 | 已发布 | 发行说明 | |
---|---|---|---|
1.0.0 |