„optimization methods“

Suchergebnisse

9.856 Treffer

• The Bloch Approximation in Periodically Perforated Media
  Conca, C. ; Gómez, D. ; Lobo, M. ; Pérez, E.
• Experimental results on Hillier's linear search
  Jeroslow, R. G. ; Smith, T. H. C.
• Necessary and sufficient conditions for a penalty method to be exact
  Bertsekas, Dimitri P.
• On the core of linear production games
  Owen, Guillermo
• Practical convergence conditions for the Davidon-Fletcher-Powell method
  Lenard, Melanie L.
• An algorithm for the determination of longest distances in a graph
  Noltemeier, Hartmut
• Matroid intersection algorithms
  Lawler, Eugene L.
• Optimally conditioned optimization algorithms without line searches
  Davidon, William C.
• A quadratically convergent primal-dual algorithm with global convergence properties for solving optimization problems with equality constraints
  Mukai, H. ; Polak, E.
• On the convergence rate of imperfect minimization algorithms in Broyden'sβ-class
  Stoer, Josef
• The eclectic primal algorithm: Cutting-plane method that accommodates hybrid subproblem solution techniques
  Young, R. D.
• A procedure to rank bases by probability of being optimal using imbedded hyperspheres
  Beer, C. N. ; Foote, B. L.
• On a general saddle-point condition in normed spaces
  Ponstein, J. ; Klein Haneveld, W. K.
• A superlinearly convergent algorithm for minimization without evaluating derivatives
  Mifflin, Robert
• A simplicial approximation of a solution for the nonlinear complementarity problem
  Lüthi, H. -J
• A unification of the existence theorems of the nonlinear complementarity problem
  Kojima, Masakazu
• An extension of Curry's theorem to steepest descent in normed linear spaces
  Byrd, R. H. ; Tapia, R. A.
• Locating the vertices of a steiner tree in an arbitrary metric space
  Sankoff, David ; Rousseau, Pascale
• A fixed point theorem including the last theorem of Poincaré
  Garcia, C. B.
• On the foundations of linear and integer linear programming I
  Graver, Jack E.