Optimally conditioned optimization algorithms without line searches William C. Davidon OriginalPaper Pages: 1 - 30
Specialised versus general-purpose algorithms for minimising functions that are sums of squared terms J. J. McKeown OriginalPaper Pages: 57 - 68
Practical convergence conditions for the Davidon-Fletcher-Powell method Melanie L. Lenard OriginalPaper Pages: 69 - 86
Necessary and sufficient conditions for a penalty method to be exact Dimitri P. Bertsekas OriginalPaper Pages: 87 - 99
A superlinearly convergent algorithm for minimization without evaluating derivatives Robert Mifflin OriginalPaper Pages: 100 - 117
On a general saddle-point condition in normed spaces J. PonsteinW. K. Klein Haneveld Short Communication Pages: 118 - 122
A procedure to rank bases by probability of being optimal using imbedded hyperspheres C. N. BeerB. L. Foote Short Communication Pages: 123 - 128
A method to accelerate the rate of convergence of a class of optimization algorithms Michael J. Best OriginalPaper Pages: 139 - 160
Polyhedral annexation in mixed integer and combinatorial programming Fred Glover OriginalPaper Pages: 161 - 188
A finite algorithm to maximize certain pseudoconcave functions on polytopes Balder von Hohenbalken OriginalPaper Pages: 189 - 206
On the foundations of linear and integer linear programming I Jack E. Graver OriginalPaper Pages: 207 - 226
A fixed point theorem including the last theorem of Poincaré C. B. Garcia OriginalPaper Pages: 227 - 239
Locating the vertices of a steiner tree in an arbitrary metric space David SankoffPascale Rousseau OriginalPaper Pages: 240 - 246
An extension of Curry's theorem to steepest descent in normed linear spaces R. H. ByrdR. A. Tapia OriginalPaper Pages: 247 - 254
A unification of the existence theorems of the nonlinear complementarity problem Masakazu Kojima OriginalPaper Pages: 257 - 277
A simplicial approximation of a solution for the nonlinear complementarity problem H. -J. Lüthi OriginalPaper Pages: 278 - 293
The eclectic primal algorithm: Cutting-plane method that accommodates hybrid subproblem solution techniques R. D. Young OriginalPaper Pages: 294 - 312
On the convergence rate of imperfect minimization algorithms in Broyden'sβ-class Josef Stoer OriginalPaper Pages: 313 - 335
A quadratically convergent primal-dual algorithm with global convergence properties for solving optimization problems with equality constraints H. MukaiE. Polak OriginalPaper Pages: 336 - 349
An algorithm for the determination of longest distances in a graph Hartmut Noltemeier OriginalPaper Pages: 350 - 357
Experimental results on Hillier's linear search R. G. JeroslowT. H. C. Smith OriginalPaper Pages: 371 - 376
