Ideal polytopes and face structures of some combinatorial optimization problems Yoshiko T. IkebeAkihisa Tamura OriginalPaper Pages: 1 - 15
A descent method with linear programming subproblems for nondifferentiable convex optimization Sehun KimKun-Nyeong ChangJun-Yeon Lee OriginalPaper Pages: 17 - 28
One-third-integrality in the max-cut problem Monique LaurentSvatopluk Poljak OriginalPaper Pages: 29 - 50
Smoothing methods for convex inequalities and linear complementarity problems Chunhui ChenO. L. Mangasarian OriginalPaper Pages: 51 - 69
An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities Alfred AuslenderMounir Haddou OriginalPaper Pages: 77 - 100
