A polynomial cycle canceling algorithm for submodular flows C. WallacherUwe T. Zimmermann Pages: 1 - 15
Linear convergence of epsilon-subgradient descent methods for a class of convex functions Stephen M. Robinson Pages: 41 - 50
Smooth methods of multipliers for complementarity problems Jonathan EcksteinMichael C. Ferris Pages: 65 - 90
A polynomial time interior–point path–following algorithm for LCP based on Chen–Harker–Kanzow smoothing techniques Song XuJames V. Burke Pages: 91 - 103
Global convergence of a class of non-interior point algorithms using Chen-Harker-Kanzow-Smale functions for nonlinear complementarity problems Keisuke HottaAkiko Yoshise Pages: 105 - 133
Strong conical hull intersection property, bounded linear regularity, Jameson’s property (G), and error bounds in convex optimization Heinz H. BauschkeJonathan M. BorweinWu Li Pages: 135 - 160
Lifting valid inequalities for the precedence constrained knapsack problem R.L.M.J. van de LeenselC.P.M. van HoeselJ.J. van de Klundert Pages: 161 - 185
Approximating the complexity measure of Vavasis-Ye algorithm is NP-hard Levent Tunçel Short Communication Pages: 219 - 223