Random walks, totally unimodular matrices, and a randomised dual simplex algorithm Martin DyerAlan Frieze OriginalPaper Pages: 1 - 16
Dynamic factorization in large-scale optimization Gerald G. BrownMichael P. Olson OriginalPaper Pages: 17 - 51
A class of gap functions for variational inequalities Torbjörn LarssonMichael Patriksson OriginalPaper Pages: 53 - 79
A proximal-based decomposition method for convex minimization problems Gong ChenMarc Teboulle OriginalPaper Pages: 81 - 101
A continuous deformation algorithm for variational inequality problems on polytopes Yang DaiYoshitsugu Yamamoto OriginalPaper Pages: 103 - 122
A globally convergent primal—dual interior point algorithm for convex programming Renato D. C. Monteiro OriginalPaper Pages: 123 - 147
A row-action method for convex programming Alfredo N. IusemB. F. Svaiter OriginalPaper Pages: 149 - 171
A criterion for time aggregation in intertemporal dynamic models Jean MercenierPhilippe Michel OriginalPaper Pages: 179 - 197
The Steiner tree problem I: Formulations, compositions and extension of facets Sunil ChopraM. R. Rao OriginalPaper Pages: 209 - 229
The Steiner tree problem II: Properties and classes of facets Sunil ChopraM. R. Rao OriginalPaper Pages: 231 - 246
On the solution of a two ball trust region subproblem M. Heinkenschloss OriginalPaper Pages: 249 - 276
Superlinearly convergent approximate Newton methods for LC1 optimization problems Liqun Qi OriginalPaper Pages: 277 - 294
New algorithms for generalized network flows Edith CohenNimrod Megiddo OriginalPaper Pages: 325 - 336
Relaxation-based algorithms for minimax optimization problems with resource allocation applications Rachelle S. KleinHanan LussUriel G. Rothblum OriginalPaper Pages: 337 - 363
On extremal behaviors of Murty's least index method Komei FukudaMakoto Namiki OriginalPaper Pages: 365 - 370
