„optimization methods“

Suchergebnisse

9.856 Treffer

• An interactive weighted Tchebycheff procedure for multiple objective programming
  Steuer, Ralph E. ; Choo, Eng-Ung
• Aggregation bounds in stochastic linear programming
  Birge, John R.
• A convergence theorem of Rosen’s gradient projection method
  Du, Ding-Zhu ; Zhang, Xiang-Sung
• An iterative scheme for variational inequalities
  Dafermos, Stella
• Convex quadratic programming with one constraint and bounded variables
  Dussault, Jean-Pierre ; Ferland, Jacques A. ; Lemaire, Bernard
• Convergence properties of relaxation algorithms
  Meyer, Gerard G. L.
• On the extended linear complementarity problem
  Gowda, M. Seetharama
• Distribution sensitivity analysis for stochastic programs with complete recourse
  Wang, Jinde
• Penalty functions in ε-programming and ε-minimax problems
  Loridan, P. ; Morgan, J.
• On the subdifferential of a submodular function
  Fujishige, Satoru
• Computational aspects of two-segment separable programming
  Meyer, R. R.
• Shortest paths algorithms: Theory and experimental evaluation
  Cherkassky, Boris V. ; Goldberg, Andrew V. ; Radzik, Tomasz
• Computational complexity of Van der Heyden's variable dimension algorithm and Dantzig-Cottle's principal pivoting method for solving LCP's
  Birge, John R. ; Gana, Akli
• Error bounds for monotone linear complementarity problems
  Mangasarian, O. L. ; Shiau, T. -H
• A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines
  Li, Wu
• Triangulations (tilings) and certain block triangular matrices
  Dantzig, G. B. ; Hoffman, A. J. ; Hu, T. C.
• Finding thet-join structure of graphs
  Sebő, András
• Projected gradient methods for linearly constrained problems
  Calamai, Paul H. ; Moré, Jorge J.
• Large-scale linear programming: Geometry, working bases and factorizations
  Todd, Michael J.
• On the superlinear convergence of a trust region algorithm for nonsmooth optimization
  Yuan, Y.