Journals in DBLP

Math. Program.
1996, volume: 76, number:

1. Michael J. Todd
   Potential-reduction methods in mathematical programming. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1996, v:76, n:, pp:3-45 [Journal]
   
2. Yurii Nesterov
   Long-step strategies in interior-point primal-dual methods. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1996, v:76, n:, pp:47-94 [Journal]
   
3. Clovis C. Gonzaga, J. Frédéric Bonnans
   Fast convergence of the simplified largest step path following algorithm. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1996, v:76, n:, pp:95-115 [Journal]
   
4. Benjamin Jansen, Kees Roos, Tamás Terlaky, Yinyu Ye
   Improved complexity using higher-order correctors for primal-dual Dikin affine scaling. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1996, v:76, n:, pp:117-130 [Journal]
   
5. Jean-Louis Goffin, Jacek Gondzio, Robert Sarkissian, Jean-Philippe Vial
   Solving nonlinear multicommodity flow problems by the analytic center cutting plane method. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1996, v:76, n:, pp:131-154 [Journal]
   
6. Kenneth O. Kortanek, Xiaojie Xu, Yinyu Ye
   An infeasible interior-point algorithm for solving primal and dual geometric programs. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1996, v:76, n:, pp:155-181 [Journal]
   
7. Roland W. Freund, Florian Jarre
   A QMR-based interior-point algorithm for solving linear programs. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1996, v:76, n:, pp:183-210 [Journal]
   
8. Yinyu Ye
   On homogeneous and self-dual algorithms for LCP. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1996, v:76, n:, pp:211-221 [Journal]
   
9. Florian A. Potra, Rongqin Sheng
   Predictor-corrector algorithm for solving P_*(k)-matrix LCP from arbitrary positive starting points. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1996, v:76, n:, pp:223-244 [Journal]
   
10. Kurt M. Anstreicher
    Volumetric path following algorithms for linear programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1996, v:76, n:, pp:245-263 [Journal]
    
11. Roman A. Polyak, Marc Teboulle
    Nonlinear rescaling and proximal-like methods in convex optimization. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1996, v:76, n:, pp:265-284 [Journal]
    
12. Wilfred Kaplan, Wei H. Yang
    Duality theorem for a generalized Fermat-Weber problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1996, v:76, n:, pp:285-297 [Journal]
    
13. Satoru Iwata
    A capacity scaling algorithm for convex cost submodular flows. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1996, v:76, n:, pp:299-308 [Journal]
    
14. Clovis C. Gonzaga
    The largest step path following algorithm for monotone linear complementarity problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1996, v:76, n:, pp:309-332 [Journal]
    
15. Kyriakos Kilakos, O. Marotte
    Fractional and integral colourings. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1996, v:76, n:, pp:333-347 [Journal]
    
16. Yuri M. Ermoliev, Arkadii V. Kryazhimskii, Andrzej Ruszczynski
    Constraint aggregation principle in convex optimization. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1996, v:76, n:, pp:353-372 [Journal]
    
17. Evgeni A. Nurminski
    Separating plane algorithms for convex optimization. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1996, v:76, n:, pp:373-391 [Journal]
    
18. Liqun Qi, Xiaojun Chen
    A preconditioning proximal Newton method for nondifferentiable convex optimization. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1996, v:76, n:, pp:411-429 [Journal]
    
19. José Mario Martínez, Antonio Carlos Moretti
    A trust region method for minimization of nonsmooth functions with linear constraints. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1996, v:76, n:, pp:431-449 [Journal]
    
20. J. Sun
    On piecewise quadratic Newton and trust region problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1996, v:76, n:, pp:451-467 [Journal]
    
21. Nobuo Yamashita, Masao Fukushima
    Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1996, v:76, n:, pp:469-491 [Journal]
    
22. Francisco Facchinei, Christian Kanzow
    A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1996, v:76, n:, pp:493-512 [Journal]
    
23. Andreas Fischer
    Solution of monotone complementarity problems with locally Lipschitzian functions. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1996, v:76, n:, pp:513-532 [Journal]
    
24. Stephen C. Billups, Michael C. Ferris
    QPCOMP: A quadratic programming based solver for mixed complementarity problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1996, v:76, n:, pp:533-562 [Journal]
    
25. Hichem Sellami, Stephen M. Robinson
    Implementation of a continuation method for normal maps. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1996, v:76, n:, pp:563-578 [Journal]
    
26. Bernd Kummer
    Parametrizations of Kojima's system and relations to penalty and barrier functions. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1996, v:76, n:, pp:579-592 [Journal]
    
27. Daniel Ralph, Stefan Scholtes
    Sensitivity analysis of composite piecewise smooth equations. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1996, v:76, n:, pp:593-612 [Journal]