Mathematical Programming, Volume 95

Volume 95, Number 1, January 2003

• Farid Alizadeh, Donald Goldfarb:
  Second-order cone programming. 3-51
  Electronic Edition (link) BibTeX
• Marko Loparic, Hugues Marchand, Laurence A. Wolsey:
  Dynamic knapsack sets and capacitated lot-sizing. 53-69
  Electronic Edition (link) BibTeX
• Andrew J. Miller, George L. Nemhauser, Martin W. P. Savelsbergh:
  A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case. 71-90
  Electronic Edition (link) BibTeX
• A. Lisser, Franz Rendl:
  Graph partitioning using linear and semidefinite programming. 91-101
  Electronic Edition (link) BibTeX
• Michael Ulbrich, Stefan Ulbrich:
  Non-monotone trust region methods for nonlinear equality constrained optimization without a penalty function. 103-135
  Electronic Edition (link) BibTeX
• Stephen J. Wright:
  Constraint identification and algorithm stabilization for degenerate nonlinear programs. 137-160
  Electronic Edition (link) BibTeX
• Dexuan Xie, Suresh B. Singh, Eugene M. Fluder:
  Principal component analysis combined with truncated-Newton minimization for dimensionality reduction of chemical databases. 161-185
  Electronic Edition (link) BibTeX

Volume 95, Number 2, February 2003

• Reha H. Tütüncü, K. C. Toh, Michael J. Todd:
  Solving semidefinite-quadratic-linear programs using SDPT3. 189-217
  Electronic Edition (link) BibTeX
• Jos F. Sturm:
  Avoiding numerical cancellation in the interior point method for solving semidefinite programs. 219-247
  Electronic Edition (link) BibTeX
• Erling D. Andersen, Cornelis Roos, Tamás Terlaky:
  On implementing a primal-dual interior-point method for conic quadratic optimization. 249-277
  Electronic Edition (link) BibTeX
• Hande Y. Benson, Robert J. Vanderbei:
  Solving Problems with Semidefinite and Related Constraints Using Interior-Point Methods for Nonlinear Programming. 279-302
  Electronic Edition (link) BibTeX
• Kazuhide Nakata, Katsuki Fujisawa, Mituhiro Fukuda:
  Exploiting sparsity in semidefinite programming via matrix completion II: implementation and numerical results. 303-327
  Electronic Edition (link) BibTeX
• Samuel Burer, Renato D. C. Monteiro:
  A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. 329-357
  Electronic Edition (link) BibTeX
• Samuel Burer, Renato D. C. Monteiro, Yin Zhang:
  A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs. 359-379
  Electronic Edition (link) BibTeX
• Christoph Helmberg:
  Numerical evaluation of SBmethod. 381-406
  Electronic Edition (link) BibTeX
• Hans D. Mittelmann:
  An independent benchmarking of SDP and SOCP solvers. 407-430
  Electronic Edition (link) BibTeX

Volume 95, Number 3, March 2003

• Xin Chen, Paul Tseng:
  Non-Interior continuation methods for solving semidefinite complementarity problems. 431-474
  Electronic Edition (link) BibTeX
• Friedrich Eisenbrand, Giovanni Rinaldi, Paolo Ventura:
  Primal separation for 0/1 polytopes. 475-491
  Electronic Edition (link) BibTeX
• Jitka Dupacová, Nicole Gröwe-Kuska, Werner Römisch:
  Scenario reduction in stochastic programming. 493-511
  Electronic Edition (link) BibTeX
• T. E. S. Raghavan, Zamir Syed:
  A policy-improvement type algorithm for solving zero-sum two-person stochastic games of perfect information. 513-532
  Electronic Edition (link) BibTeX
• Edoardo Amaldi, Marc E. Pfetsch, Leslie E. Trotter Jr.:
  On the maximum feasible subsystem problem, IISs and IIS-hypergraphs. 533-554
  Electronic Edition (link) BibTeX
• Andreas Griewank, Uwe Naumann:
  Accumulating Jacobians as chained sparse matrix products. 555-571
  Electronic Edition (link) BibTeX
• Javier M. Moguerza, Francisco J. Prieto:
  An augmented Lagrangian interior-point method using directions of negative curvature. 573-616
  Electronic Edition (link) BibTeX
• Klaus Jansen, Lorant Porkolab:
  Computing optimal preemptive schedules for parallel tasks: linear programming approaches. 617-630
  Electronic Edition (link) BibTeX
• A. F. Izmailov, Mikhail V. Solodov:
  Karush-Kuhn-Tucker systems: regularity conditions, error bounds and a class of Newton-type methods. 631-650
  Electronic Edition (link) BibTeX