Optimal Jacobian accumulation is NP-complete.
- Published in:
- Mathematical Programming, 2008, v. 112, n. 2, p. 427, doi. 10.1007/s10107-006-0042-z
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2008 AND VI 112 AND IP 2
Results: 9
1
2
Breakpoint searching algorithms for the continuous quadratic knapsack problem.
- Published in:
- Mathematical Programming, 2008, v. 112, n. 2, p. 473, doi. 10.1007/s10107-006-0050-z
- By:
- Publication type:
- Article
3
Generating facets for the cut polytope of a graph by triangular elimination.
- Published in:
- Mathematical Programming, 2008, v. 112, n. 2, p. 303, doi. 10.1007/s10107-006-0018-z
- By:
- Publication type:
- Article
4
Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs.
- Published in:
- Mathematical Programming, 2008, v. 112, n. 2, p. 335, doi. 10.1007/s10107-006-0020-5
- By:
- Publication type:
- Article
5
On the complexity of general matrix scaling and entropy minimization via the RAS algorithm.
- Published in:
- Mathematical Programming, 2008, v. 112, n. 2, p. 371, doi. 10.1007/s10107-006-0021-4
- By:
- Publication type:
- Article
6
Newton’s iterates can converge to non-stationary points.
- Published in:
- Mathematical Programming, 2008, v. 112, n. 2, p. 327, doi. 10.1007/s10107-006-0019-y
- By:
- Publication type:
- Article
7
Dual multilevel optimization.
- Published in:
- Mathematical Programming, 2008, v. 112, n. 2, p. 403, doi. 10.1007/s10107-006-0022-3
- By:
- Publication type:
- Article
8
Robust branch-cut-and-price for the Capacitated Minimum Spanning Tree problem over a large extended formulation.
- Published in:
- Mathematical Programming, 2008, v. 112, n. 2, p. 443, doi. 10.1007/s10107-006-0043-y
- By:
- Publication type:
- Article
9
A sparse proximal implementation of the LP dual active set algorithm.
- Published in:
- Mathematical Programming, 2008, v. 112, n. 2, p. 275, doi. 10.1007/s10107-006-0017-0
- By:
- Publication type:
- Article