.png){kind=icon}
Return
Smoothing-type algorithm for solving linear programs by using an augmented complementarity problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2005.11.012.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present a smoothing-type algorithm for solving the linear program (LP) by making use of an augmented system of its optimality conditions. The algorithm is shown to be globally convergent without requiring any assumption. It only needs to solve one system of linear equations and to perform one line search at each iteration. In particular, if the LP has a solution (and hence it has a strictly complementary solution), then the algorithm will generate a strictly complementary solution of the LP; and if the LP is infeasible, then the algorithm will correctly detect infeasibility of the LP. To the best of our knowledge, this is the first smoothing-type algorithm for solving the LP having the above desired convergence features. (c) 2005 Elsevier Inc. All rights reserved.
Keywords:
linear program
smoothing algorithm
strictly complementary solution
global convergence
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
No organization information available
Cited Papers
.png){kind=icon}
Left atrial appendage occlusion: On the need of a numerical model to simulate the implant procedure
PREAI
ShareSave
View more