A cutting plane algorithm for convex programming that uses analytic centers David S. AtkinsonPravin M. Vaidya OriginalPaper Pages: 1 - 43
A cutting plane method from analytic centers for stochastic programming O. BahnO. du MerleJ. -P. Vial OriginalPaper Pages: 45 - 73
A sufficient condition for self-concordance, with application to some classes of structured convex programming problems D. den HertogF. JarreT. Terlaky OriginalPaper Pages: 75 - 88
Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities Krzysztof C. Kiwiel OriginalPaper Pages: 89 - 109
New variants of bundle methods Claude LemaréchalArkadii NemirovskiiYurii Nesterov OriginalPaper Pages: 111 - 147
Complexity estimates of some cutting plane methods based on the analytic barrier Yu. Nesterov OriginalPaper Pages: 149 - 176
An interior-point method for generalized linear-fractional programming Yu. E. NesterovA. S. Nemirovskii OriginalPaper Pages: 177 - 204
A primal—dual potential reduction method for problems involving matrix inequalities Lieven VandenbergheStephen Boyd OriginalPaper Pages: 205 - 236
A continuation method for monotone variational inequalities Bintong ChenPatrick T. Harker OriginalPaper Pages: 237 - 253
Nonlinear mappings associated with the generalized linear complementarity problem Aniekan Ebiefung OriginalPaper Pages: 255 - 268
About strongly polynomial time algorithms for quadratic optimization over submodular constraints Dorit S. HochbaumSung-Pil Hong OriginalPaper Pages: 269 - 309
Superlinear primal-dual affine scaling algorithms for LCP R. D. C. MonteiroS. J. Wright OriginalPaper Pages: 311 - 333
Worst-case comparison of valid inequalities for the TSP Michel X. Goemans OriginalPaper Pages: 335 - 349
A quadratically convergent\(O((\kappa + 1)\sqrt n L)\)-iteration algorithm for theP *(κ)-matrix linear complementarity problem Jianming Miao OriginalPaper Pages: 355 - 368
An algebraic geometry algorithm for scheduling in presence of setups and correlated demands Sridhar R. TayurRekha R. ThomasN. R. Natraj OriginalPaper Pages: 369 - 401
Necessary and sufficient condition for local minima of a class of nonconvex quadratic programs Jia-Ming Cao OriginalPaper Pages: 403 - 411
Dual decomposition of a single-machine scheduling problem S. L. van de Velde OriginalPaper Pages: 413 - 428
The complexity of approximating a nonlinear program Mihir BellarePhillip Rogaway OriginalPaper Pages: 429 - 441
Pure adaptive search for finite global optimization Z. B. ZabinskyG. R. WoodW. P. Baritompa OriginalPaper Pages: 443 - 448
New algorithms for lineark-matroid intersection and matroidk-parity problems Alexander I. Barvinok OriginalPaper Pages: 449 - 470
On games corresponding to sequencing situations with ready times Herbert HamersPeter BormStef Tijs OriginalPaper Pages: 471 - 483