Mathematical Programming, Volume 103

Volume 103, Number 1, May 2005

• JiGuan G. Lin:
  On min-norm and min-max methods of multi-objective optimization. 1-33
  
• Hartwig Bosse, Martin Grötschel, Martin Henk:
  Polynomial inequalities representing polyhedra. 35-44
  
• Masakazu Kojima, Sunyoung Kim, Hayato Waki:
  Sparsity in sums of squares of polynomials. 45-62
  
• J. Charles Gilbert, Clovis C. Gonzaga, Elizabeth W. Karas:
  Examples of ill-behaved central paths in convex optimization. 63-94
  
• María J. Cánovas, Marco A. López, Juan Parra, F. Javier Toledo:
  Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems. 95-126
  
• Yu. Nesterov:
  Smooth minimization of non-smooth functions. 127-152
  
• Donald Goldfarb, K. Scheinberg:
  Product-form Cholesky factorization in interior point methods for second-order cone programming. 153-179
  
• Satoru Iwata, Satoko Moriguchi, Kazuo Murota:
  A capacity scaling algorithm for M-convex submodular flow. 181-202
  

Volume 103, Number 2, June 2005

• Sven Leyffer, Jorge J. Moré:
  Foreword: Special Issue on Deterministic Global Optimization and Applications. 203-205
  
• Clifford A. Meyer, Christodoulos A. Floudas:
  Convex envelopes for edge-concave functions. 207-224
  
• Mohit Tawarmalani, Nikolaos V. Sahinidis:
  A polyhedral branch-and-cut approach to global optimization. 225-249
  
• Jeff Linderoth:
  A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs. 251-282
  
• B. Bhattacharjee, Panayiotis Lemonidis, William H. Green Jr., Paul I. Barton:
  Global solution of semi-infinite programs. 283-307
  
• Dorin Preda, Joseph Noailles:
  Mixed integer programming for a special logic constrained optimal control problem. 309-333
  
• Arnold Neumaier, Oleg Shcherbina, Waltraud Huyer, Tamás Vinkó:
  A comparison of complete global optimization solvers. 335-356
  
• Mathias Stolpe, Atsushi Kawamoto:
  Design of planar articulated mechanisms using branch and bound. 357-397
  
• Diane C. Jamrog, George N. Phillips Jr., Richard A. Tapia, Yin Zhang:
  A global optimization method for the molecular replacement problem in X-ray crystallography. 399-426
  

Volume 103, Number 3, July 2005

• Samuel Burer, Renato D. C. Monteiro:
  Local Minima and Convergence in Low-Rank Semidefinite Programming. 427-444
  
• Geoffrey Pritchard, Andrew B. Philpott, Philip J. Neame:
  Hydroelectric reservoir optimization in a pool market. 445-461
  
• Matti Koivu:
  Variance reduction in sample approximations of stochastic programs. 463-485
  
• João X. da Cruz Neto, Orizon P. Ferreira, Renato D. C. Monteiro:
  Asymptotic behavior of the central path for a special class of degenerate SDP problems. 487-514
  
• Tamás Kis:
  A branch-and-cut algorithm for scheduling of projects with variable-intensity activities. 515-539
  
• Yu-Hong Dai, Roger Fletcher:
  On the asymptotic behaviour of some new gradient methods. 541-559
  
• Javier Peña:
  On the block-structured distance to non-surjectivity of sublinear mappings. 561-573
  
• Defeng Sun, Jie Sun:
  Strong Semismoothness of the Fischer-Burmeister SDC and SOC Complementarity Functions. 575-581
  
• Egon Balas, Cid C. de Souza:
  The vertex separator problem: a polyhedral investigation. 583-608
  
• Cid C. de Souza, Egon Balas:
  The vertex separator problem: algorithms and computations. 609-631