A successive quadratic programming algorithm with global and superlinear convergence properties Masao Fukushima OriginalPaper Pages: 253 - 264
A recursive quadratic programming algorithm that uses differentiable exact penalty functions M. J. D. PowellY. Yuan OriginalPaper Pages: 265 - 278
A class of convergent primal-dual subgradient algorithms for decomposable convex programs S. SenHanif D. Sherali OriginalPaper Pages: 279 - 297
A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm Satoru Fujishige OriginalPaper Pages: 298 - 308
A regularized decomposition method for minimizing a sum of polyhedral functions Andrzej RuszczyĆski OriginalPaper Pages: 309 - 333
Solving multiple criteria problems by interactive decomposition Rafael Lazimy OriginalPaper Pages: 334 - 361
On the average length of lexicographic paths M. L. BalinskiTh. M. LieblingA. -E. Nobs Short Communication Pages: 362 - 364
Characterizing an optimal input in perturbed convex programming: Corrigendum S. Zlobec Short Communication Pages: 368 - 371
Announcement International Conference on Optimization: Techniques and Applications Notice Pages: 373 - 373