Interior-point methods for nonconvex nonlinear programming: Jamming and numerical testing.
- Published in:
- Mathematical Programming, 2004, v. 99, n. 1, p. 35, doi. 10.1007/s10107-003-0418-2
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2004 AND VI 99 AND IP 1
Results: 9
1
2
Solving linear programs with finite precision: I. Condition numbers and random programs.
- Published in:
- Mathematical Programming, 2004, v. 99, n. 1, p. 175, doi. 10.1007/s10107-003-0393-7
- By:
- Publication type:
- Article
3
A product-form Cholesky factorization method for handling dense columns in interior point methods for linear programming.
- Published in:
- Mathematical Programming, 2004, v. 99, n. 1, p. 1, doi. 10.1007/s10107-003-0377-7
- By:
- Publication type:
- Article
4
Epsilon-proximal decomposition method.
- Published in:
- Mathematical Programming, 2004, v. 99, n. 1, p. 89, doi. 10.1007/s10107-003-0371-0
- By:
- Publication type:
- Article
5
The BFGS method with exact line searches fails for non-convex objective functions.
- Published in:
- Mathematical Programming, 2004, v. 99, n. 1, p. 49, doi. 10.1007/s10107-003-0421-7
- By:
- Publication type:
- Article
6
Approximating disjoint-path problems using packing integer programs.
- Published in:
- Mathematical Programming, 2004, v. 99, n. 1, p. 63, doi. 10.1007/s10107-002-0370-6
- By:
- Publication type:
- Article
7
On robust optimization of two-stage systems.
- Published in:
- Mathematical Programming, 2004, v. 99, n. 1, p. 109, doi. 10.1007/s10107-003-0373-y
- By:
- Publication type:
- Article
8
On the convergence of Newton iterations to non-stationary points.
- Published in:
- Mathematical Programming, 2004, v. 99, n. 1, p. 127, doi. 10.1007/s10107-003-0376-8
- By:
- Publication type:
- Article
9
Augmented self-concordant barriers and nonlinear optimization problems with finite complexity.
- Published in:
- Mathematical Programming, 2004, v. 99, n. 1, p. 149, doi. 10.1007/s10107-003-0392-8
- By:
- Publication type:
- Article