Convergence and efficiency of subgradient methods for quasiconvex minimization.
- Published in:
- Mathematical Programming, 2001, v. 90, n. 1, p. 1, doi. 10.1007/PL00011414
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2001 AND VI 90 AND IP 1
Results: 9
1
2
Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems.
- Published in:
- Mathematical Programming, 2001, v. 90, n. 1, p. 59, doi. 10.1007/PL00011420
- By:
- Publication type:
- Article
3
On the solitaire cone and its relationship to multi-commodity flows.
- Published in:
- Mathematical Programming, 2001, v. 90, n. 1, p. 27, doi. 10.1007/PL00011419
- By:
- Publication type:
- Article
4
On the convergence of the Newton/log-barrier method.
- Published in:
- Mathematical Programming, 2001, v. 90, n. 1, p. 71, doi. 10.1007/PL00011421
- By:
- Publication type:
- Article
5
A .699-approximation algorithm for Max-Bisection.
- Published in:
- Mathematical Programming, 2001, v. 90, n. 1, p. 101, doi. 10.1007/PL00011415
- By:
- Publication type:
- Article
6
On a characterization of convexity-preserving maps, Davidon's collinear scalings and Karmarkar's projective transformations.
- Published in:
- Mathematical Programming, 2001, v. 90, n. 1, p. 153, doi. 10.1007/PL00011417
- By:
- Publication type:
- Article
7
Logarithmic SUMT limits in convex programming.
- Published in:
- Mathematical Programming, 2001, v. 90, n. 1, p. 113, doi. 10.1007/PL00011416
- By:
- Publication type:
- Article
8
The core and nucleolus of games: A note on a paper by Göthe-Lundgren et al.
- Published in:
- Mathematical Programming, 2001, v. 90, n. 1, p. 147, doi. 10.1007/PL00013711
- By:
- Publication type:
- Article
9
Quadratic convergence of potential-reduction methods for degenerate problems.
- Published in:
- Mathematical Programming, 2001, v. 90, n. 1, p. 169
- By:
- Publication type:
- Article