Citation: A. Nemirovski et al., On maximization of quadratic form over intersection of ellipsoids with common center, MATH PROGR, 86(3), 1999, pp. 463-473
Citation: S. Boyd et R. Carr, A new bound for the ratio between the 2-matching problem and its linear programming relaxation, MATH PROGR, 86(3), 1999, pp. 499-514
Citation: Jm. Peng et Zh. Lin, A non-interior continuation method for generalized linear complementarity problems, MATH PROGR, 86(3), 1999, pp. 533-563
Citation: F. Vanderbeck, Computational study of a column generation algorithm for bin packing and cutting stock problems, MATH PROGR, 86(3), 1999, pp. 565-594
Citation: M. Heinkenschloss et al., Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption, MATH PROGR, 86(3), 1999, pp. 615-635
Authors:
Mohan, SR
Neogy, SK
Parthasarathy, T
Sinha, S
Citation: Sr. Mohan et al., Vertical linear complementarity and discounted zero-sum stochastic games with ARAT structure, MATH PROGR, 86(3), 1999, pp. 637-648
Citation: Rm. Freund et Jr. Vera, Some characterizations and properties of the "distance to ill-posedness" and the condition measure of a conic linear system, MATH PROGR, 86(2), 1999, pp. 225-260
Authors:
Berkelaar, AB
Jansen, B
Roos, K
Terlaky, T
Citation: Ab. Berkelaar et al., Basis- and partition identification for quadratic programming and linear complementarity problems, MATH PROGR, 86(2), 1999, pp. 261-282
Citation: Jm. Peng et M. Fukushima, A hybrid Newton method for solving the variational inequality problem via the D-gap function, MATH PROGR, 86(2), 1999, pp. 367-386
Citation: Ab. Levy, Errata in implicit multifunction theorems for the sensitivity analysis of variational conditions, MATH PROGR, 86(2), 1999, pp. 439-441