On the local convergence of adjoint Broyden methods.
- Published in:
- Mathematical Programming, 2010, v. 121, n. 2, p. 221, doi. 10.1007/s10107-008-0232-y
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2010 AND VI 121 AND IP 2
Results: 8
1
2
Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations.
- Published in:
- Mathematical Programming, 2010, v. 121, n. 2, p. 307, doi. 10.1007/s10107-008-0235-8
- By:
- Publication type:
- Article
3
Copositive programming motivated bounds on the stability and the chromatic numbers.
- Published in:
- Mathematical Programming, 2010, v. 121, n. 2, p. 249, doi. 10.1007/s10107-008-0233-x
- By:
- Publication type:
- Article
4
Constructing a sequence of discrete Hessian matrices of an SC<sup>1</sup> function uniformly convergent to the generalized Hessian matrix.
- Published in:
- Mathematical Programming, 2010, v. 121, n. 2, p. 387, doi. 10.1007/s10107-008-0238-5
- By:
- Publication type:
- Article
5
Optimal wire ordering and spacing in low power semiconductor design.
- Published in:
- Mathematical Programming, 2010, v. 121, n. 2, p. 201, doi. 10.1007/s10107-008-0231-z
- By:
- Publication type:
- Article
6
Representing the space of linear programs as the Grassmann manifold.
- Published in:
- Mathematical Programming, 2010, v. 121, n. 2, p. 353, doi. 10.1007/s10107-008-0237-6
- By:
- Publication type:
- Article
7
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm.
- Published in:
- Mathematical Programming, 2010, v. 121, n. 2, p. 269, doi. 10.1007/s10107-008-0234-9
- By:
- Publication type:
- Article
8
Lattice based extended formulations for integer linear equality systems.
- Published in:
- Mathematical Programming, 2010, v. 121, n. 2, p. 337, doi. 10.1007/s10107-008-0236-7
- By:
- Publication type:
- Article