External Links

    Journal: Math. Program. Comput.

    Volume 4, Issue 4

    307 -- 331Hans Pirnay, Rodrigo López-Negrete, Lorenz T. Biegler. Optimal sensitivity based on IPOPT
    333 -- 361Zaiwen Wen, Wotao Yin, Yin Zhang. Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
    363 -- 381Stephan Held, William Cook, Edward C. Sewell. Maximum-weight stable sets and safe lower bounds for graph coloring
    383 -- 412Oliver Exler, Thomas Lehmann, Klaus Schittkowski. A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization

    Volume 4, Issue 3

    211 -- 238Victor Zverovich, Csaba I. Fábián, Eldon F. D. Ellison, Gautam Mitra. A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition
    239 -- 273Matteo Fischetti, Michele Monaci. Cutting plane versus compact formulations for uncertain (integer) linear programs
    275 -- 306Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Alexander Martin. LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison

    Volume 4, Issue 2

    109 -- 149Jean-Paul Watson, David L. Woodruff, William E. Hart. PySP: modeling and solving stochastic programs in Python
    151 -- 179Pierre Bonami. On optimizing over lift-and-project closures
    181 -- 209Frank E. Curtis. A penalty-interior-point algorithm for nonlinear constrained optimization

    Volume 4, Issue 1

    1 -- 31Giacomo Nannicini, Pietro Belotti. Rounding-based heuristics for nonconvex MINLPs
    33 -- 52Jieqiu Chen, Samuel Burer. Globally solving nonconvex quadratic programming problems via completely positive programming
    53 -- 69Robert J. Vanderbei. Fast Fourier optimization
    71 -- 107Michael P. Friedlander, Dominique Orban. A primal-dual regularized interior-point method for convex quadratic programs
    runs on