A general cone decomposition theory based on efficiency J. E. Martínez-LegazA. Seeger OriginalPaper Pages: 1 - 20
Duality in disjunctive programming via vector optimization Siegfried Helbig OriginalPaper Pages: 21 - 41
Global convergence in infeasible-interior-point algorithms Masakazu KojimaToshihito NomaAkiko Yoshise OriginalPaper Pages: 43 - 72
Solving cone-constrained convex programs by differential inclusions Sjur D. FlåmAlberto Seeger OriginalPaper Pages: 107 - 121
A separation algorithm for the matchable set polytope William H. CunninghamJan Green-Krótki OriginalPaper Pages: 139 - 150
A nonsmooth Newton method for variational inequalities, I: Theory Baichun XiaoPatrick T. Harker OriginalPaper Pages: 151 - 194
A nonsmooth Newton method for variational inequalities, II: Numerical results Baichun XiaoPatrick T. Harker OriginalPaper Pages: 195 - 216
Interior-point algorithms for semi-infinite programming Michael J. Todd OriginalPaper Pages: 217 - 245
The least prior deviation quasi-Newton update R. B. MifflinJ. L. Nazareth OriginalPaper Pages: 247 - 261
Formulation of linear problems and solution by a universal machine B. Curtis EavesUriel G. Rothblum OriginalPaper Pages: 263 - 309
Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms Igor Averbakh OriginalPaper Pages: 311 - 330
A regularization of the Frank—Wolfe method and unification of certain nonlinear programming methods Athanasios Migdalas OriginalPaper Pages: 331 - 345
Limiting behavior of weighted central paths in linear programming Osman Güler OriginalPaper Pages: 347 - 363
A two-stage successive overrelaxation algorithm for solving the symmetric linear complementarity problem Karen T. Medhi OriginalPaper Pages: 365 - 380
