Works matching IS 00255610 AND DT 2011 AND VI 127 AND IP 2
Results: 6
Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results.
- Published in:
- Mathematical Programming, 2011, v. 127, n. 2, p. 245, doi. 10.1007/s10107-009-0286-5
- By:
- Publication type:
- Article
Efficient branch-and-bound algorithms for weighted MAX-2-SAT.
- Published in:
- Mathematical Programming, 2011, v. 127, n. 2, p. 297, doi. 10.1007/s10107-009-0285-6
- By:
- Publication type:
- Article
A partition-based relaxation for Steiner trees.
- Published in:
- Mathematical Programming, 2011, v. 127, n. 2, p. 345, doi. 10.1007/s10107-009-0289-2
- By:
- Publication type:
- Article
A warm-start approach for large-scale stochastic linear programs.
- Published in:
- Mathematical Programming, 2011, v. 127, n. 2, p. 371, doi. 10.1007/s10107-009-0290-9
- By:
- Publication type:
- Article
A first-order interior-point method for linearly constrained smooth optimization.
- Published in:
- Mathematical Programming, 2011, v. 127, n. 2, p. 399, doi. 10.1007/s10107-009-0292-7
- By:
- Publication type:
- Article
An interactive weight space reduction procedure for nonlinear multiple objective mathematical programming.
- Published in:
- Mathematical Programming, 2011, v. 127, n. 2, p. 425, doi. 10.1007/s10107-009-0293-6
- By:
- Publication type:
- Article