„optimization methods“

Suchergebnisse

9.856 Treffer

• ε-Optimal solutions in nondifferentiable convex programming and some related questions
  Strodiot, J. -J ; Nguyen, V. Hien ; Heukemes, Norbert
• Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic problems
  Nemirovskii, Arkadii ; Scheinberg, Katya
• A dual differentiable exact penalty function
  Han, S. -P ; Mangasarian, O. L.
• A primal-dual algorithm for the fermat-weber problem involving mixed gauges
  Michelot, C. ; Lefebvre, O.
• A primal-dual approach to inexact subgradient methods
  Au, Kelly T.
• Global convergence of the partitioned BFGS algorithm for convex partially separable optimization
  Toint, Ph. L.
• The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm
  Hassin, Refael
• Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming
  Yinyu, YE ; Kojima, Masakazu
• The flow circulation sharing problem
  Brown, J. Randall
• A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables
  Tuy, Hoang ; Ghannadan, Saied ; Migdalas, Athanasios ; Värbrand, Peter
• Integral decomposition in polyhedra
  McDiarmid, Colin
• Controlled perturbations for quadratically constrained quadratic programs
  Fang, S. C. ; Rajasekera, J. R.
• Optimization of unconstrained functions with sparse Hessian matrices—Quasi-Newton methods
  Thapa, Mukund N.
• Computation of all solutions to a system of polynomial equations
  Kojima, Masakazu ; Mizuno, Shinji
• A note on the Talman, Van der Heyden linear complementarity algorithm
  Jones, Philip C.
• Characterizing an optimal input in perturbed convex programming
  Zlobec, S.
• A note on limiting infisup theorems
  Pomerol, J. -C
• On the length of simplex paths: The assignment case
  Lindberg, P. O. ; Ólafsson, Snjólfur
• Adjacency on polymatroids
  Topkis, Donald M.
• Convergence of the cyclical relaxation method for linear inequalities
  Mandel, Jan