Primal-dual first-order methods with \({\mathcal {O}(1/\epsilon)}\) iteration-complexity for cone programming Guanghui LanZhaosong LuRenato D. C. Monteiro FULL LENGTH PAPER 06 February 2009 Pages: 1 - 29
A qualitative mathematical analysis of a class of linear variational inequalities via semi-complementarity problems: applications in electronics Khalid AddiB. BrogliatoD. Goeleven Full Length Paper 18 February 2009 Pages: 31 - 67
A class of nonlinear nonseparable continuous knapsack and multiple-choice knapsack problems Thomas C. SharkeyH. Edwin RomeijnJoseph Geunes FULL LENGTH PAPER 05 March 2009 Pages: 69 - 96
A polynomial oracle-time algorithm for convex integer minimization Raymond HemmeckeShmuel OnnRobert Weismantel FULL LENGTH PAPER 06 March 2009 Pages: 97 - 117
An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem Luigi GrippoLaura PalagiVeronica Piccialli FULL LENGTH PAPER 10 March 2009 Pages: 119 - 146
Orbital branching James OstrowskiJeff LinderothStefano Smriglio FULL LENGTH PAPER 10 March 2009 Pages: 147 - 178
A note on second-order stochastic dominance constraints induced by mixed-integer linear recourse Ralf GollmerUwe GotzesRĂ¼diger Schultz Full Length Paper 13 February 2009 Pages: 179 - 190
Erratum to: The capacitated max k-cut problem Daya Ram GaurRamesh KrishnamurtiRajeev Kohli Erratum 18 September 2010 Pages: 191 - 191
A computational study on robust portfolio selection based on a joint ellipsoidal uncertainty set Zhaosong Lu Short Communication 11 February 2009 Pages: 193 - 201