External Links

    Journal: Math. Program.

    Volume 87, Issue 3

    351 -- 383Javier Peña, James Renegar. Computing approximate solutions for convex conic systems of constraints
    385 -- 399Francisco Barahona, Ranga Anbil. The volume algorithm: producing primal solutions with a subgradient method
    401 -- 426Le Thi Hoai An. An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
    427 -- 439Mourad Baïou, Michel Balinski. The stable admissions polytope
    441 -- 452Xiaotie Deng, Toshihide Ibaraki, Hiroshi Nagamochi, Wenan Zang. Totally balanced combinatorial optimization games
    453 -- 465Shuzhong Zhang. Quadratic maximization and semidefinite relaxation
    467 -- 481Gianpaolo Ghiani, Gilbert Laporte. A branch-and-cut algorithm for the Undirected Rural Postman Problem
    483 -- 499Ulrich Faigle, Walter Kern. On the core of ordered submodular cost games
    501 -- 517Song Xu. P -functions
    519 -- 542Vladimir G. Deineko, Gerhard J. Woeginger. A study of exponential neighborhoods for the Travelling Salesman Problem and for the Quadratic Assignment Problem
    543 -- 560Serpil Sayin. Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
    561 -- 573Ya-Xiang Yuan. On the truncated conjugate gradient method

    Volume 87, Issue 2

    203 -- 207K. A. Ariyawansa, R. B. Mifflin, J. L. Nazareth. Studies in algorithmic optimization: Festschrift in Honor of William C. Davidon
    209 -- 213C. G. Broyden. On the discovery of the "good Broyden" method
    215 -- 249Andrew R. Conn, Nicholas I. M. Gould, Dominique Orban, Philippe L. Toint. A primal-dual trust-region algorithm for non-convex nonlinear programming
    251 -- 264Roger Fletcher. Stable reduced Hessian updates for indefinite quadratic programming
    265 -- 280John Greenstadt. Reminiscences on the development of the variational approach to Davidon's variable-metric method
    281 -- 301M. J. D. Powell. On the convergence of the DFP algorithm for unconstrained optimization when there are only two variables
    303 -- 316David F. Shanno, Robert J. Vanderbei. Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methods
    317 -- 350Michael Wagner, Michael J. Todd. Least-change quasi-Newton updates for equality-constrained optimization

    Volume 87, Issue 1

    1 -- 35Liqun Qi, Defeng Sun, Guanglu Zhou. A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
    37 -- 56Alberto Caprara, Matteo Fischetti, Adam N. Letchford. k cuts
    57 -- 86Philip J. Neame, Natashia Boland, Daniel Ralph. An outer approximate subdifferential method for piecewise affine optimization
    87 -- 111William H. Cunningham, Yaoguang Wang. Restricted 2-factor polytopes
    113 -- 130Jim Burke, Song Xu. A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem
    131 -- 152Charles Audet, Pierre Hansen, Brigitte Jaumard, Gilles Savard. A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
    153 -- 175Stephen C. Billups. Improving the robustness of descent-based methods for semismooth equations using proximal perturbations
    177 -- 187Peter A. Beling, Sushil Verma. A probabilistic analysis of a measure of combinatorial complexity for the central curve
    189 -- 202Mikhail V. Solodov, Benar Fux Svaiter. Forcing strong convergence of proximal point iterations in a Hilbert space
    runs on