The SCEAS System
Navigation Menu

Journals in DBLP

Math. Program.
1991, volume: 50, number:

  1. Jean Charles Gilbert
    Maintaining the positive definiteness of the matrices in reduced secant methods for equality constrained optimization. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:50, n:, pp:1-28 [Journal]
  2. Ilan Adler, Renato D. C. Monteiro
    Limiting behavior of the affine scaling continuous trajectories for linear programming problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:50, n:, pp:29-51 [Journal]
  3. A. B. Gamble, Andrew R. Conn, William R. Pulleyblank
    A network penalty method. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:50, n:, pp:53-73 [Journal]
  4. Sehun Kim, Hyunsil Ahn
    Convergence of a generalized subgradient method for nondifferentiable convex optimization. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:50, n:, pp:75-80 [Journal]
  5. Sanjay Mehrotra, Jie Sun
    On computing the center of a convex quadratically constrained set. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:50, n:, pp:81-89 [Journal]
  6. Chang C. Y. Dorea
    Effort associated with a class of random optimization methods. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:50, n:, pp:91-98 [Journal]
  7. Dinh The Luc
    Contingent derivatives of set-valued maps and applications to vector optimization. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:50, n:, pp:99-111 [Journal]
  8. Ulrich Derigs, A. Metz
    Solving (large scale) matching problems combinatorially. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:50, n:, pp:113-121 [Journal]
  9. Arie Tamir
    On the core of network synthesis games. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:50, n:, pp:123-135 [Journal]
  10. Andreas Griewank
    The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:50, n:, pp:141-175 [Journal]
  11. Andrew R. Conn, Nicholas I. M. Gould, Philippe L. Toint
    Convergence of quasi-Newton matrices generated by the symmetric rank one update. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:50, n:, pp:177-195 [Journal]
  12. Werner Römisch, Rüdiger Schultz
    Distribution sensitivity in stochastic programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:50, n:, pp:197-226 [Journal]
  13. Jerzy A. Filar, T. A. Schultz, F. Thuijsman, O. J. Vrieze
    Nonlinear programming and stationary equilibria in stochastic games. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:50, n:, pp:227-237 [Journal]
  14. Yinyu Ye
    An O(n3L) potential reduction algorithm for linear programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:50, n:, pp:239-258 [Journal]
  15. Reiner Horst, Nguyen V. Thoai, Harold P. Benson
    Concave minimization via conical partitions and polyhedral outer approximation. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:50, n:, pp:259-274 [Journal]
  16. Andrew V. Goldberg, Michael D. Grigoriadis, Robert Endre Tarjan
    Use of dynamic trees in a network simplex algorithm for the maximum flow problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:50, n:, pp:277-290 [Journal]
  17. D. A. Bayer, Jeffrey C. Lagarias
    Karmarkar's linear programming algorithm and Newton's method. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:50, n:, pp:291-330 [Journal]
  18. Masakazu Kojima, Shinji Mizuno, Akiko Yoshise
    An O(square root(n) * L) iteration potential reduction algorithm for linear complementarity problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:50, n:, pp:331-342 [Journal]
  19. Arnold Lent, Yair Censor
    The primal-dual algorithm as a constraint-set-manipulation device. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:50, n:, pp:343-357 [Journal]
  20. Michael C. Ferris
    Finite termination of the proximal point algorithm. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:50, n:, pp:359-366 [Journal]
  21. Anton Dekkers, Emile H. L. Aarts
    Global optimization and simulated annealing. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:50, n:, pp:367-393 [Journal]
  22. Itamar Pitowsky
    Correlation polytopes: Their geometry and complexity. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:50, n:, pp:395-414 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002