A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities Liqun QiDefeng SunGuanglu Zhou Pages: 1 - 35
On the separation of maximally violated mod-k cuts Alberto CapraraMatteo FischettiAdam N. Letchford Pages: 37 - 56
An outer approximate subdifferential method for piecewise affine optimization Philip NeameNatashia BolandDaniel Ralph Pages: 57 - 86
A non–interior predictor–corrector path following algorithm for the monotone linear complementarity problem Jim BurkeSong Xu Pages: 113 - 130
A branch and cut algorithm for nonconvex quadratically constrained quadratic programming Charles AudetPierre HansenGilles Savard Pages: 131 - 152
Improving the robustness of descent-based methods for semismooth equations using proximal perturbations Stephen C. Billups Pages: 153 - 175
A probabilistic analysis of a measure of combinatorial complexity for the central curve Peter A. BelingSushil Verma Pages: 177 - 187
Forcing strong convergence of proximal point iterations in a Hilbert space M.V. SolodovB.F. Svaiter Pages: 189 - 202