Partially finite convex programming, Part I: Quasi relative interiors and duality theory J. M. BorweinA. S. Lewis OriginalPaper Pages: 15 - 48
Partially finite convex programming, Part II: Explicit lattice models J. M. BorweinA. S. Lewis OriginalPaper Pages: 49 - 83
Generalizations of Slater's constraint qualification for infinite convex programs V. JeyakumarHenry Wolkowicz OriginalPaper Pages: 85 - 101
Optimality conditions for non-finite valued convex composite functions J. V. BurkeR. A. Poliquin OriginalPaper Pages: 103 - 120
Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices Ilan AdlerPeter A. Beling OriginalPaper Pages: 121 - 143
Exterior point algorithms for nearest points and convex quadratic programs K. S. Al-SultanK. G. Murty OriginalPaper Pages: 145 - 161
A scaling technique for finding the weighted analytic center of a polytope David S. AtkinsonPravin M. Vaidya OriginalPaper Pages: 163 - 192
On better heuristics for Steiner minimum trees Ding-Zhu DuYanjun Zhang OriginalPaper Pages: 193 - 202
A continuous approach to inductive inference Anil P. KamathNarendra K. KarmarkarMauricio G. C. Resende OriginalPaper Pages: 215 - 238
An interior point algorithm of\(O(\sqrt m \left| {\ln \varepsilon } \right|)\) iterations forC 1-convex programming Jie SunLiqun Qi OriginalPaper Pages: 239 - 257
A polynomial-time algorithm for computing the yolk in fixed dimension Craig A. Tovey OriginalPaper Pages: 259 - 277
Approximation algorithms for indefinite quadratic programming Stephen A. Vavasis OriginalPaper Pages: 279 - 311
On average complexity of global optimization problems G. W. Wasilkowski OriginalPaper Pages: 313 - 324
On the finite convergence of interior-point algorithms for linear programming Yinyu Ye OriginalPaper Pages: 325 - 335
Open questions in complexity theory for numerical optimization Panos M. PardalosStephen A. Vavasis OriginalPaper Pages: 337 - 339
Steepest-edge simplex algorithms for linear programming John J. ForrestDonald Goldfarb OriginalPaper Pages: 341 - 374
Gainfree Leontief substitution flow problems Robert G. JeroslowKipp MartinJinchang Wang OriginalPaper Pages: 375 - 414
The generalized linear complementarity problem and an algorithm to find all its solutions Bart De MoorLieven VandenbergheJoos Vandewalle OriginalPaper Pages: 415 - 426
On finite convergence and constraint identification of subgradient projection methods Sjur D. Flåm OriginalPaper Pages: 427 - 437
Optimal and sub-optimal stopping rules for the Multistart algorithm in global optimization B. BetròF. Schoen OriginalPaper Pages: 445 - 458
An analogue of Hoffman's circulation conditions for max-balanced flows Mark HartmannMichael H. Schneider OriginalPaper Pages: 459 - 476
A short proof of finiteness of Murty's principal pivoting algorithm Jiri Rohn Erratum Pages: 477 - 477
