Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming Michael J. ToddYinyu Ye OriginalPaper Pages: 1 - 21
On the projected subgradient method for nonsmooth convex optimization in a Hilbert space Ya. I. AlberA. N. IusemM. V. Solodov OriginalPaper Pages: 23 - 35
Characterization of the barrier parameter of homogeneous convex cones Osman GülerLevent Tunçel OriginalPaper Pages: 55 - 76
An interior point method, based on rank-1 updates, for linear programming Jos F. SturmShuzhong Zhang OriginalPaper Pages: 77 - 87
Hesitant adaptive search for global optimisation D. W. BulgerG. R. Wood OriginalPaper Pages: 89 - 102
A continuation method for (strongly) monotone variational inequalities Christian KanzowHouyuan Jiang OriginalPaper Pages: 103 - 125
Global one-dimensional optimization using smooth auxiliary functions Yaroslav D. Sergeyev OriginalPaper Pages: 127 - 146