Deriving collinear scaling algorithms as extensions of quasi-Newton methods and the local convergence of DFP- and BFGS-related collinear scaling algorithms K. A. Ariyawansa OriginalPaper Pages: 23 - 48
The equipartition polytope. I: Formulations, dimension and basic facets Michele ConfortiM. R. RaoAntonio Sassano OriginalPaper Pages: 49 - 70
The equipartition polytope. II: Valid inequalities and facets Michele ConfortiM. R. RaoAntonio Sassano OriginalPaper Pages: 71 - 90
Making sparse matrices sparser: Computational results S. Thomas McCormick OriginalPaper Pages: 91 - 111
Recession cones and the domination property in vector optimization Dinh The Luc OriginalPaper Pages: 113 - 122
Implicit functions and sensitivity of stationary points H. Th. JongenD. KlatteK. Tammer OriginalPaper Pages: 123 - 138
Corrigenda to “Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity” Stephen M. Robinson Notice Pages: 143 - 143
Feasibility issues in a primal-dual interior-point method for linear programming Irvin J. Lustig OriginalPaper Pages: 145 - 162
Optimizing over the subtour polytope of the travelling salesman problem S. C. BoydW. R. Pulleyblank OriginalPaper Pages: 163 - 187
A trust region algorithm for equality constrained optimization M. J. D. PowellY. Yuan OriginalPaper Pages: 189 - 211
Second order necessary optimality conditions for minimizing a sup-type function H. Kawasaki OriginalPaper Pages: 213 - 229
A successive quadratic programming method for a class of constrained nonsmooth optimization problems Masao Fukushima OriginalPaper Pages: 231 - 251
Computation of equilibria in an economy with increasing returns to scale technologies Kazuya Kamiya OriginalPaper Pages: 253 - 261
On superlinear convergence in univariate nonsmooth minimization Robert Mifflin OriginalPaper Pages: 273 - 279
A topological characterization for closed sets under polar duality in ℚ n M. HartmannL. E. Trotter Jr. Short communication Pages: 281 - 283
An analysis of reduced Hessian methods for constrained optimization Richard H. ByrdJorge Nocedal OriginalPaper Pages: 285 - 323
An O(n 3 L) primal interior point algorithm for convex quadratic programming D. GoldfarbS. Liu OriginalPaper Pages: 325 - 340
On the convergence of the method of analytic centers when applied to convex quadratic programs F. Jarre OriginalPaper Pages: 341 - 358
Variable target value subgradient method Sehun KimHyunsil AhnSeong-Cheol Cho OriginalPaper Pages: 359 - 369
On the equivalence between strong solvability and strict semimonotonicity for some systems involving Z-functions Carmen HerreroJose A. Silva OriginalPaper Pages: 371 - 379
Capacitated, balanced, sequential location-allocation problems on chains and trees Hanif D. Sherali OriginalPaper Pages: 381 - 396
On the solution of concave knapsack problems Jorge J. MoréStephen A. Vavasis OriginalPaper Pages: 397 - 411
Guidelines for reporting results of computational experiments. Report of the ad hoc committee Richard H. F. JacksonPaul T. BoggsSusan Powell OriginalPaper Pages: 413 - 425
Announcement of a summer school on nonsmooth optimization. Methods and applications Notice Pages: 429 - 429
