Sciweavers

SIAMJO
2002
159views more  SIAMJO 2002»
14 years 6 days ago
Locating the Least 2-Norm Solution of Linear Programs via a Path-Following Method
A linear program has a unique least 2-norm solution provided that the linear program has a solution. To locate this solution, most of the existing methods were devised to solve cer...
Yun-Bin Zhao, Duan Li
ORL
2008
86views more  ORL 2008»
14 years 15 days ago
A redundant Klee-Minty construction with all the redundant constraints touching the feasible region
By introducing some redundant Klee-Minty constructions, we have previously shown that the central path may visit every vertex of the Klee-Minty cube having 2n - 2 "sharp"...
Eissa Nematollahi, Tamás Terlaky
EOR
2008
103views more  EOR 2008»
14 years 19 days ago
New complexity analysis of IIPMs for linear optimization based on a specific self-regular function
Primal-dual Interior-Point Methods (IPMs) have shown their ability in solving large classes of optimization problems efficiently. Feasible IPMs require a strictly feasible startin...
Maziar Salahi, M. Reza Peyghami, Tamás Terl...