A strongly polynomial algorithm for the transportation problem P. KleinschmidtH. Schannath OriginalPaper Pages: 1 - 13
A family of variable metric proximal methods J. F. BonnansJ. Ch. GilbertC. A. Sagastizábal OriginalPaper Pages: 15 - 47
On the choice of parameters for power-series interior point algorithms in linear programming Gongyun Zhao OriginalPaper Pages: 49 - 71
Stochastic on-line knapsack problems A. Marchetti-SpaccamelaC. Vercellis OriginalPaper Pages: 73 - 104
A numerical approach to optimization problems with variational inequality constraints Jiří OutrataJochem Zowe OriginalPaper Pages: 105 - 130
A note on the strong polynomiality of convex quadratic programming Sung-Pil HongSushil Verma OriginalPaper Pages: 131 - 139
On the convergence of the iteration sequence in primal-dual interior-point methods Richard A. TapiaYin ZhangYinyu Ye OriginalPaper Pages: 141 - 154
Resolving degeneracy in combinatorial linear programs: Steepest edge, steepest ascent, and parametric ascent E. Andrew Boyd OriginalPaper Pages: 155 - 168
Minimal representation of quadratically constrained convex feasible regions Wiesława T. ObuchowskaRichard J. Caron OriginalPaper Pages: 169 - 186
On co-positive, semi-monotoneQ-matrices G. S. R. MurthyT. ParthasarathyG. Ravindran OriginalPaper Pages: 187 - 203
A characterization of weakly efficient points Pascual Ruíz-CanalesAntonio Rufián-Lizana OriginalPaper Pages: 205 - 212
Computational experience with a difficult mixedinteger multicommodity flow problem D. BienstockO. Günlük OriginalPaper Pages: 213 - 237
The precedence-constrained asymmetric traveling salesman polytope Egon BalasMatteo FischettiWilliam R. Pulleyblank OriginalPaper Pages: 241 - 265
A trust-region strategy for minimization on arbitrary domains José Mario MartínezSandra Augusta Santos OriginalPaper Pages: 267 - 301
On polynomiality of the Mehrotra-type predictor—corrector interior-point algorithms Yin ZhangDetong Zhang OriginalPaper Pages: 303 - 318
A unified approach to global convergence of trust region methods for nonsmooth optimization John E. Dennis Jr.Shou-Bai B. LiRichard A. Tapia OriginalPaper Pages: 319 - 346
Solving large-scale minimax problems with the primal—dual steepest descent algorithm Ciyou Zhu Erratum Pages: 347 - 347