Testing balancedness and perfection of linear matrices Michele ConfortiM. R. Rao OriginalPaper Pages: 1 - 18
Analysis of a self-scaling quasi-Newton method Jorge NocedalYa-xiang Yuan OriginalPaper Pages: 19 - 37
A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio Ilan AdlerRon Shamir OriginalPaper Pages: 39 - 52
Constraint classification in mathematical programming Arnon BonehShahar BonehRichard J. Caron OriginalPaper Pages: 61 - 73
An algorithm for solving convex programs with an additional convex—concave constraint Dung Le Muu OriginalPaper Pages: 75 - 87
Minimization of a quasi-concave function over an efficient set S. Bolintineanu OriginalPaper Pages: 89 - 110
Bounding multi-stage stochastic programs from above Stein W. WallaceTiecheng Yan OriginalPaper Pages: 111 - 129
A copositive Q-matrix which is notR 0 G. S. R. MurthyT. ParthasarathyG. Ravindran OriginalPaper Pages: 131 - 135
On the complexity of approximating the maximal inscribed ellipsoid for a polytope Leonid G. KhachiyanMichael J. Todd OriginalPaper Pages: 137 - 159
An O(n 3 L) primal—dual potential reduction algorithm for solving convex quadratic programs Donald GoldfarbShucheng Liu OriginalPaper Pages: 161 - 170
Some new results regarding spikes and a heuristic for spike construction Jayaram K. Sankaran OriginalPaper Pages: 171 - 195
Quantitative stability of variational systems: III.ε-approximate solutions Hedy AttouchRoger J. -B. Wets OriginalPaper Pages: 197 - 214
A new technique for generating quadratic programming test problems Paul H. CalamaiLuis N. VicenteJoaquim J. Júdice OriginalPaper Pages: 215 - 231
A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes Kazuyuki SekitaniYoshitsugu Yamamoto OriginalPaper Pages: 233 - 249
On the failure of maximum entropy reconstruction for Fredholm equations and other infinite systems Jonathan M. Borwein OriginalPaper Pages: 251 - 261
A primal—dual infeasible-interior-point algorithm for linear programming Masakazu KojimaNimrod MegiddoShinji Mizuno OriginalPaper Pages: 263 - 280
A general descent framework for the monotone variational inequality problem Jia Hao WuMichael FlorianPatrice Marcotte OriginalPaper Pages: 281 - 300
Stochastic programming with simple integer recourse François V. LouveauxMaarten H. van der Vlerk OriginalPaper Pages: 301 - 325
A note on sufficient conditions forQ 0 andQ 0 ⋂P 0 matrices G. S. R. Murthy OriginalPaper Pages: 345 - 349
Finding all maximal efficient faces in multiobjective linear programming Paul Armand OriginalPaper Pages: 357 - 375
Characterization of perturbed mathematical programs and interval analysis John J. DinkelMarietta J. Tretter OriginalPaper Pages: 377 - 384
A simple constraint qualification in convex programming X. ZhouF. Sharifi MokhtarianS. Zlobec OriginalPaper Pages: 385 - 397
