Componentwise fast convergence in the solution of full-rank systems of nonlinear equations.
- Published in:
- Mathematical Programming, 2002, v. 92, n. 3, p. 481
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2002 AND VI 92 AND IP 3
Results: 9
1
2
An improved rounding method and semidefinite programming relaxation for graph partition.
- Published in:
- Mathematical Programming, 2002, v. 92, n. 3, p. 509, doi. 10.1007/s101070100288
- By:
- Publication type:
- Article
3
UOBYQA: unconstrained optimization by quadratic approximation.
- Published in:
- Mathematical Programming, 2002, v. 92, n. 3, p. 555, doi. 10.1007/s101070100290
- By:
- Publication type:
- Article
4
Foreword.
- Published in:
- Mathematical Programming, 2002, v. 92, n. 3, p. 391, doi. 10.1007/s101070100291
- By:
- Publication type:
- Article
5
A BFGS-IP algorithm for solving strongly convex optimization problems with feasibility enforced by an exact penalty approach.
- Published in:
- Mathematical Programming, 2002, v. 92, n. 3, p. 393
- By:
- Publication type:
- Article
6
On capacitated network design cut–set polyhedra.
- Published in:
- Mathematical Programming, 2002, v. 92, n. 3, p. 425
- By:
- Publication type:
- Article
7
On the chromatic polynomial of a graph.
- Published in:
- Mathematical Programming, 2002, v. 92, n. 3, p. 439, doi. 10.1007/s101070100285
- By:
- Publication type:
- Article
8
Robust optimization – methodology and applications.
- Published in:
- Mathematical Programming, 2002, v. 92, n. 3, p. 453, doi. 10.1007/s101070100286
- By:
- Publication type:
- Article
9
Multicriteria decision making under uncertainty.
- Published in:
- Mathematical Programming, 2002, v. 92, n. 3, p. 537, doi. 10.1007/s101070100289
- By:
- Publication type:
- Article