Journals in DBLP

Math. Program.
1992, volume: 57, number:

1. Michael C. Ferris, Olvi L. Mangasarian
   Minimum principle sufficiency. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1992, v:57, n:, pp:1-14 [Journal]
   
2. Jonathan M. Borwein, A. S. Lewis
   Partially finite convex programming, Part I: Quasi relative interiors and duality theory. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1992, v:57, n:, pp:15-48 [Journal]
   
3. Jonathan M. Borwein, A. S. Lewis
   Partially finite convex programming, Part II: Explicit lattice models. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1992, v:57, n:, pp:49-83 [Journal]
   
4. Vaithilingam Jeyakumar, Henry Wolkowicz
   Generalizations of Slater's constraint qualification for infinite convex programs. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1992, v:57, n:, pp:85-101 [Journal]
   
5. James V. Burke, R. A. Poliquin
   Optimality conditions for non-finite valued convex composite functions. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1992, v:57, n:, pp:103-120 [Journal]
   
6. Ilan Adler, Peter A. Beling
   Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1992, v:57, n:, pp:121-143 [Journal]
   
7. K. S. Al-Sultan, Katta G. Murty
   Exterior point algorithms for nearest points and convex quadratic programs. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1992, v:57, n:, pp:145-161 [Journal]
   
8. David S. Atkinson, Pravin M. Vaidya
   A scaling technique for finding the weighted analytic center of a polytope. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1992, v:57, n:, pp:163-192 [Journal]
   
9. Ding-Zhu Du, Yanjun Zhang
   On better heuristics for Steiner minimum trees. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1992, v:57, n:, pp:193-202 [Journal]
   
10. Peter Gritzmann, Victor Klee
    Deciding uniqueness in norm maximization. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:57, n:, pp:203-214 [Journal]
    
11. Anil P. Kamath, Narendra Karmarkar, K. G. Ramakrishnan, Mauricio G. C. Resende
    A continuous approach to inductive inference. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:57, n:, pp:215-238 [Journal]
    
12. Jie Sun, Liqun Qi
    An interior point algorithm of O(Quadrat Root(m) absolute (ln epsilon)) iterations for C-convex programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:57, n:, pp:239-257 [Journal]
    
13. Craig A. Tovey
    A polynomial-time algorithm for computing the yolk in fixed dimension. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:57, n:, pp:259-277 [Journal]
    
14. Stephen A. Vavasis
    Approximation algorithms for indefinite quadratic programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:57, n:, pp:279-311 [Journal]
    
15. Grzegorz W. Wasilkowski
    On average complexity of global optimization problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:57, n:, pp:313-324 [Journal]
    
16. Yinyu Ye
    On the finite convergence of interior-point algorithms for linear programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:57, n:, pp:325-335 [Journal]
    
17. Panos M. Pardalos, Stephen A. Vavasis
    Open questions in complexity theory for numerical optimization. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:57, n:, pp:337-339 [Journal]
    
18. John J. Forrest, Donald Goldfarb
    Steepest-edge simplex algorithms for linear programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:57, n:, pp:341-374 [Journal]
    
19. Robert G. Jeroslow, Kipp Martin, Ronald L. Rardin, Jinchang Wang
    Gainfree Leontief substitution flow problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:57, n:, pp:375-414 [Journal]
    
20. Bart De Moor, Lieven Vandenberghe, Joos Vandewalle
    The generalized linear complementarity problem and an algorithm to find all its solutions. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:57, n:, pp:415-426 [Journal]
    
21. Sjur Didrik Flåm
    On finite convergence and constraint identification of subgradient projection methods. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:57, n:, pp:427-437 [Journal]
    
22. Wallace C. Pye
    Almost P₀-matrices and the class Q. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:57, n:, pp:439-444 [Journal]
    
23. Bruno Betrò, Fabio Schoen
    Optimal and sub-optimal stopping rules for the Multistart algorithm in global optimization. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:57, n:, pp:445-458 [Journal]
    
24. Mark E. Hartmann, Michael H. Schneider
    An analogue of Hoffman's circulation conditions for max-balanced flows. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:57, n:, pp:459-476 [Journal]