Journals in DBLP

Math. Program.
2004, volume: 99, number: 1

1. Donald Goldfarb, K. Scheinberg
   A product-form Cholesky factorization method for handling dense columns in interior point methods for linear programming. [Citation Graph (0, 0)][DBLP]
   Math. Program., 2004, v:99, n:1, pp:1-34 [Journal]
   
2. Hande Y. Benson, David F. Shanno, Robert J. Vanderbei
   Interior-point methods for nonconvex nonlinear programming: Jamming and numerical testing. [Citation Graph (0, 0)][DBLP]
   Math. Program., 2004, v:99, n:1, pp:35-48 [Journal]
   
3. Walter F. Mascarenhas
   The BFGS method with exact line searches fails for non-convex objective functions. [Citation Graph (0, 0)][DBLP]
   Math. Program., 2004, v:99, n:1, pp:49-61 [Journal]
   
4. Stavros G. Kolliopoulos, Clifford Stein
   Approximating disjoint-path problems using packing integer programs. [Citation Graph (0, 0)][DBLP]
   Math. Program., 2004, v:99, n:1, pp:63-87 [Journal]
   
5. Adam Ouorou
   Epsilon-proximal decomposition method. [Citation Graph (0, 0)][DBLP]
   Math. Program., 2004, v:99, n:1, pp:89-108 [Journal]
   
6. Samer Takriti, Shabbir Ahmed
   On robust optimization of two-stage systems. [Citation Graph (0, 0)][DBLP]
   Math. Program., 2004, v:99, n:1, pp:109-126 [Journal]
   
7. Richard H. Byrd, Marcelo Marazzi, Jorge Nocedal
   On the convergence of Newton iterations to non-stationary points. [Citation Graph (0, 0)][DBLP]
   Math. Program., 2004, v:99, n:1, pp:127-148 [Journal]
   
8. Yu. Nesterov, Jean-Philippe Vial
   Augmented self-concordant barriers and nonlinear optimization problems with finite complexity. [Citation Graph (0, 0)][DBLP]
   Math. Program., 2004, v:99, n:1, pp:149-174 [Journal]
   
9. Dennis Cheung, Felipe Cucker
   Solving linear programs with finite precision: I. Condition numbers and random programs. [Citation Graph (0, 0)][DBLP]
   Math. Program., 2004, v:99, n:1, pp:175-196 [Journal]