Mathematical Programming, Volume 109

Volume 109, Number 1, January 2007

• Monique Laurent:
  Semidefinite representations for finite varieties. 1-26
  
• Matteo Fischetti, Cristiano Saturni:
  Mixed-Integer Cuts from Cyclic Groups. 27-53
  
• Alain Billionnet, Sourour Elloumi:
  Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem. 55-68
  
• Simon P. Schurr, André L. Tits, Dianne P. O'Leary:
  Universal duality in conic convex optimization. 69-88
  
• Pasquale Avella, Antonio Sassano, Igor Vasil'ev:
  Computational study of large-scale p -Median problems. 89-114
  
• Agostinho Agra, Miguel Fragoso Constantino:
  Lifting two-integer knapsack inequalities. 115-154
  
• Mohammad R. Oskoorouchi, Jean-Louis Goffin:
  A matrix generation approach for eigenvalue optimization. 155-179
  
• Napsu Haarala, Kaisa Miettinen, Marko M. Mäkelä:
  Globally convergent limited memory bundle method for large-scale nonsmooth optimization. 181-205
  

Volume 109, Numbers 2-3, March 2007

• Erling S. Andersen, Etienne de Klerk, Levent Tunçel, Henry Wolkowicz, Shuzhong Zhang:
  Foreword: Special issue on large-scale nonlinear and semidefinite programming. 207-209
  
• Zhaosong Lu, Arkadi Nemirovski, Renato D. C. Monteiro:
  Large-scale semidefinite programming via a saddle point Mirror-Prox algorithm. 211-237
  
• Monique Laurent:
  Strengthened semidefinite programming bounds for codes. 239-261
  
• Samuel Burer, Jon Lee:
  Solving maximum-entropy sampling problems using factored masks. 263-281
  
• Arkadi Nemirovski:
  Sums of random symmetric matrices and quadratic optimization under orthogonality constraints. 283-317
  
• Yurii Nesterov:
  Dual extrapolation and its applications to solving variational inequalities and related problems. 319-344
  
• Igor Dukanovic, Franz Rendl:
  Semidefinite programming relaxations for graph coloring and maximal clique problems. 345-365
  
• Anthony Man-Cho So, Yinyu Ye:
  Theory of semidefinite programming for Sensor Network Localization. 367-384
  
• Zhaosong Lu, Renato D. C. Monteiro:
  A modified nearly exact method for solving low-rank trust region subproblem. 385-411
  
• Michal Kocvara, Michael Stingl:
  On the solution of large-scale SDP problems by the modified barrier method using iterative solvers. 413-444
  
• Robert M. Freund, Fernando Ordóñez, Kim-Chuan Toh:
  Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems. 445-475
  
• Madhu V. Nayakkankuppam:
  Solving large-scale semidefinite programs in parallel. 477-504
  
• Franz Rendl, Renata Sotirov:
  Bounds for the quadratic assignment problem using the bundle method. 505-524
  
• Pavlo A. Krokhmal, Don A. Grundel, Panos M. Pardalos:
  Asymptotic behavior of the expected optimal value of the multidimensional assignment problem. 525-551
  
• Mituhiro Fukuda, Bastiaan J. Braams, Maho Nakata, Michael L. Overton, Jerome K. Percus, Makoto Yamashita, Zhengji Zhao:
  Large-scale semidefinite programs in electronic structure calculation. 553-580
  
• Roland W. Freund, Florian Jarre, Christoph H. Vogelbusch:
  Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling. 581-611
  
• Etienne de Klerk, Dmitrii V. Pasechnik, Alexander Schrijver:
  Reduction of symmetric semidefinite programs using the regular *-representation. 613-624