„optimization methods“

Suchergebnisse

9.856 Treffer

• A decomposition algorithm for linear relaxation of the weightedr-covering problem
  Agarwal, S. ; Mittal, A. K. ; Sharma, P.
• On the global convergence of trust region algorithms for unconstrained minimization
  Powell, M. J. D.
• Stochastic global optimization methods part I: Clustering methods
  Rinnooy Kan, A. H. G. ; Timmer, G. T.
• Marginal values and second-order necessary conditions for optimality
  Tyrrel Rockafellar, R.
• A two-stage feasible directions algorithm for nonlinear constrained optimization
  Herskovits, José
• The convergence of variable metric matrices in unconstrained optimization
  Ren-pu, Ge ; Powell, M. J. D.
• Computing nonlinear network equilibria
  Jones, Philip C. ; Saigal, Romesh ; Schneider, Michael
• Revisions of constraint approximations in the successive QP method for nonlinear programming problems
  Tone, Kaoru
• Integral approximation sequences
  Beck, Jozsef ; Spencer, Joel
• A primal-dual interior point method whose running time depends only on the constraint matrix
  Vavasis, Stephen A. ; Ye, Yinyu
• An efficient simplicial algorithm for computing a zero of a convex union of smooth functions
  Awoniyi, Samuel A. ; Todd, Michael J.
• CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
  Drud, Arne
• An ellipsoid algorithm for nonlinear programming
  Ecker, J. G. ; Kupferschmid, M.
• A cutting plane approach to capacitated lot-sizing with start-up costs
  Constantino, Miguel Fragoso
• Convex infinite horizon programs
  Grinold, Richard
• Equivalence of some quadratic programming algorithms
  Best, Michael J.
• Maximum-throughput dynamic network flows
  Orlin, James B.
• Implementing bounds-based approximations in convex-concave two-stage stochastic programming
  Edirisinghe, N. C. P. ; Ziemba, W. T.
• Cross decomposition for mixed integer programming
  Roy, Tony J. Van
• Quadratic geometric programming with application to machining economics
  Jefferson, Thomas R. ; Scott, Carlton H.