Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a P-matrix.
- Published in:
- Mathematical Programming, 2012, v. 134, n. 2, p. 349, doi. 10.1007/s10107-010-0439-6
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2012 AND VI 134 AND IP 2
Results: 8
1
2
Hyperbolic set covering problems with competing ground-set elements.
- Published in:
- Mathematical Programming, 2012, v. 134, n. 2, p. 323, doi. 10.1007/s10107-010-0431-1
- By:
- Publication type:
- Article
3
Validation analysis of mirror descent stochastic approximation method.
- Published in:
- Mathematical Programming, 2012, v. 134, n. 2, p. 425, doi. 10.1007/s10107-011-0442-6
- By:
- Publication type:
- Article
4
Subsmooth semi-infinite and infinite optimization problems.
- Published in:
- Mathematical Programming, 2012, v. 134, n. 2, p. 365, doi. 10.1007/s10107-011-0440-8
- By:
- Publication type:
- Article
5
Integrated market selection and production planning: complexity and solution approaches.
- Published in:
- Mathematical Programming, 2012, v. 134, n. 2, p. 395, doi. 10.1007/s10107-011-0441-7
- By:
- Publication type:
- Article
6
On the power and limitations of affine policies in two-stage adaptive optimization.
- Published in:
- Mathematical Programming, 2012, v. 134, n. 2, p. 491, doi. 10.1007/s10107-011-0444-4
- By:
- Publication type:
- Article
7
A strongly polynomial algorithm for linear systems having a binary solution.
- Published in:
- Mathematical Programming, 2012, v. 134, n. 2, p. 533, doi. 10.1007/s10107-011-0445-3
- By:
- Publication type:
- Article
8
The static stochastic knapsack problem with normally distributed item sizes.
- Published in:
- Mathematical Programming, 2012, v. 134, n. 2, p. 459, doi. 10.1007/s10107-011-0443-5
- By:
- Publication type:
- Article