„optimization methods“

Suchergebnisse

9.856 Treffer

• A note on heuristics for the traveling salesman problem
  d'Atri, Gianfranco
• Finding all solutions to polynomial systems and other systems of equations
  Garcia, C. B. ; Zangwill, W. I.
• Optimality conditions for quadratic programming
  Majthay, Antal
• A note about sparsity exploiting quasi-Newton updates
  Toint, Ph
• Cyclic subgradient projections
  Censor, Yair ; Lent, Arnold
• Improved algorithm for mixed-integer quadratic programs and a computational study
  Lazimy, Rafael
• Regular (2, 2)-systems
  Euler, Reinhardt
• On the Bartels—Golub decomposition for linear programming bases
  Goldfarb, D.
• Call for papers: Symposium on Mathematical Programming with Data Perturbations – May 24–25, 1979 at The George Washington University, Washington, DC, U.S.A
  Chairman, General ; Chairman, Program
• The polynomial hierarchy and a simple model for competitive analysis
  Jeroslow, Robert G.
• Discrete optimization on a multivariable boolean lattice
  Wilde, D. J. ; Sanchez-Anton, J. M.
• Optimization of pipe networks
  Hansen, Claus Thorp ; Madsen, Kaj ; Nielsen, Hans Bruun
• A new continuation method for complementarity problems with uniformP-functions
  Kojima, Masakazu ; Mizuno, Shinji ; Noma, Toshihito
• Conjugate direction methods with variable storage
  Nazareth, Larry ; Nocedal, Jorge
• Modifications and implementation of the ellipsoid algorithm for linear programming
  Goldfarb, Donald ; Todd, Michael J.
• Second-order conditions for an exact penalty function
  Coleman, T. F. ; Conn, A. R.
• An only 2-step Q-superlinear convergence example for some algorithms that use reduced hessian approximations
  Yuan, Y.
• Polyhedral polarity defined by a general bilinear inequality
  Griffin, Victor ; Aráoz, Julián ; Edmonds, Jack
• On the complexity of a piecewise linear algorithm for approximating roots of complex polynomials
  Renegar, James
• Feasible direction methods for stochastic programming problems
  Ruszczyński, Andrzej