„optimization methods“

Suchergebnisse

9.856 Treffer

• Exploiting structure in piecewise-linear homotopy algorithms for solving equations
  Todd, Michael J.
• Distribution sensitivity in stochastic programming
  Römisch, Werner ; Schultz, Rüdiger
• Testing for complete efficiency in a vector maximization problem
  Benveniste, Mathilde
• Nonlinear leastpth optimization and nonlinear programming
  Charalambous, Christakis
• A note on perfect duality and limiting lagrangeans
  Borwein, J. M.
• Convergence of quasi-Newton matrices generated by the symmetric rank one update
  Conn, A. R. ; Gould, N. I. M. ; Toint, Ph. L.
• The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients
  Griewank, Andreas
• Bilinear programming: An exact algorithm
  Gallo, Giorgio ; Ülkücü, Aydin
• A family of variable metric updates
  Nazareth, Larry
• On minquantile and maxcovering optimisation
  Carrizosa, E. ; Plastria, F.
• A finite procedure for determining if a quadratic form is bounded below on a closed polyhedral convex set
  Eaves, B. Curtis
• A generalization of the Frank—Wolfe theorem
  Perold, André F.
• On the core of network synthesis games
  Tamir, A.
• An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities
  Auslender, Alfred ; Haddou, Mounir
• Tight bounds for christofides' traveling salesman heuristic
  Cornuejols, G. ; Nemhauser, G. L.
• Accelerated convergence for the Powell/Hestenes multiplier method
  Jittorntrum, Krisorn
• The use of augmented lagrangian functions for sensitivity analysis in nonlinear programming
  Buys, J. D. ; Gonin, R.
• Design and implementation of optimization software – International Summer School Organized by the Working Committee on Algorithms of the Mathematical Programming Society Sponsored by the Scientific Affairs Division of the North Atlantic Treaty Organization
  Lootsma, F. A. ; Greenberg, H. J.
• Computational results on an algorithm for finding all vertices of a polytope
  Mattheiss, T. H. ; Schmidt, Brian K.
• The Fermat—Weber location problem revisited
  Brimberg, J.