A Smoothing Method for a Mathematical Program with P-Matrix Linear Complementarity Constraints Xiaojun ChenMasao Fukushima OriginalPaper Pages: 223 - 246
Comparison of Two Kinds of Prediction-Correction Methods for Monotone Variational Inequalities Bingsheng HeXiaoming YuanJason J.Z. Zhang OriginalPaper Pages: 247 - 267
Convergence Analysis of an Infeasible Interior Point Algorithm Based on a Regularized Central Path for Linear Complementarity Problems Guanglu ZhouKim-Chuan TohGongyun Zhao OriginalPaper Pages: 269 - 283
A Non-Interior Path Following Method for Convex Quadratic Programming Problems with Bound Constraints Song Xu OriginalPaper Pages: 285 - 303
A Network Improvement Problem Under Different Norms J.Z. ZhangX.G. YangM.C. Cai OriginalPaper Pages: 305 - 319