A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities.
- Published in:
- Mathematical Programming, 2000, v. 87, n. 1, p. 1, doi. 10.1007/s101079900127
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2000 AND VI 87 AND IP 1
Results: 9
1
2
On the separation of maximally violated mod-k cuts.
- Published in:
- Mathematical Programming, 2000, v. 87, n. 1, p. 37, doi. 10.1007/s101079900107
- By:
- Publication type:
- Article
3
An outer approximate subdifferential method for piecewise affine optimization.
- Published in:
- Mathematical Programming, 2000, v. 87, n. 1, p. 57, doi. 10.1007/s101079900112
- By:
- Publication type:
- Article
4
A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem.
- Published in:
- Mathematical Programming, 2000, v. 87, n. 1, p. 113, doi. 10.1007/s101079900111
- By:
- Publication type:
- Article
5
Restricted 2-factor polytopes.
- Published in:
- Mathematical Programming, 2000, v. 87, n. 1, p. 87, doi. 10.1007/s101079900110
- By:
- Publication type:
- Article
6
A branch and cut algorithm for nonconvex quadratically constrained quadratic programming.
- Published in:
- Mathematical Programming, 2000, v. 87, n. 1, p. 131, doi. 10.1007/s101079900106
- By:
- Publication type:
- Article
7
Improving the robustness of descent-based methods for semismooth equations using proximal perturbations.
- Published in:
- Mathematical Programming, 2000, v. 87, n. 1, p. 153, doi. 10.1007/s101079900105
- By:
- Publication type:
- Article
8
A probabilistic analysis of a measure of combinatorial complexity for the central curve.
- Published in:
- Mathematical Programming, 2000, v. 87, n. 1, p. 177, doi. 10.1007/s101079900125
- By:
- Publication type:
- Article
9
Forcing strong convergence of proximal point iterations in a Hilbert space.
- Published in:
- Mathematical Programming, 2000, v. 87, n. 1, p. 189, doi. 10.1007/s101079900113
- By:
- Publication type:
- Article