Mathematical Programming 1993: Vol 61 Index

3 Pages·1993·0.54 MB·English

Mathematical Programming 61 (1993) 399-400
North-Holland
Author Index Volume 61
Adler, I. and R. Shamir, A randomized scheme for speeding up algorithms for linear and
convex programming problems with high constraints-to-variables ratio (1) 39- 52
Armand, P., Finding all maximal efficient faces in multiobjective linear programming (3) 357-375
Attouch, H. and R.J.-B. Wets, Quantitative stability of variational systems: III. e-approximate
solutions (2) 197-214
Bolintineanu, S., Minimization of a quasi-concave function over an efficient set (1) 89-110
Boneh, A., S. Boneh and R.J. Caron, Constraint classification in mathematical programming (1) 61- 73
Boneh, S., see A. Boneh (1) 61- 73
Borwein, J.M., On the failure of maximum entropy reconstruction for Fredholm equations
and other infinite systems (2) 251-261
Calamai, P.H., L.N. Vicente and J.J. Jtidice, A new technique for generating quadratic
programming test problems (2) 215-231
Caron, R.J., see A. Boneh (1) 61- 73
Conforti, M. and M.R. Rao, Testing balancedness and perfection of linear matrices (1) 1-18
Crama, Y., Concave extensions for nonlinear 0-1 maximization problems (1) 53- 60
Dinkel, J.J. and M.J. Tretter, Characterization of perturbed mathematical programs and inter-
(3) 377-384
val analysis
(3) 327-343
Eaves, B.C. and U.G. Rothblum, A class of ‘‘onto’’ multifunctions
(3) 281-300
Florian, M., see J.H. Wu
Goldfarb, D. and S. Liu, An O(°L) primal—dual potential reduction algorithm for solving
convex quadratic programs (2) 161-170
Juidice, J.J., see PH. Calamai (2) 215-231
Khachiyan, L.G. and M.J. Todd, On the complexity of approximating the maximal inscribed
ellipsoid for a polytope (2) 137-159
Kojima, M., N. Megiddo and S. Mizuno, A primal—dual infeasible-inerior-point algorithm
for linear programming (3) 263-280
Liu, S., see D. Goldfarb (2) 161-170
Louveaux, F.V. and M.H. van der Vlerk, Stochastic programming with simple integer recourse (3) 301-325
Marcotte, P., see J.LH. Wu (3) 281-300
Megiddo, N., see M. Kojima (3) 263-280
Miao, J., Ky Fan’s N-matrices and linear complementarity problems (3) 351-356
Mizuno, S., see M. Kojima (3) 263-280
Mokhtarian, F.S., see X. Zhou (3) 385-397
Murthy, G.S.R., T. Parthasarathy and G. Ravindran, A copositive Q-matrix which is not Ro (1) 131-135
Murthy, G.S.R., A note on sufficient conditions for Qy and Q)M Py matrices (3) 345-349
Muu, Le Dung, An algorithm for solving convex programs with an additional convex—concave
constraint (1) 75- 87
Nocedal, J. and Y.-x. Yuan, Analysis of a self-scaling quasi- Newton method (1) 19- 37
Parthasarathy, T., see G.S.R. Murthy (1) 131-135
Rao, M.R., see M. Conforti (1) 1-18
Ravindran, G., see G.S.R. Murthy (1) 131-135
Rothblum, U.G., see B.C. Eaves (3) 327-343
Sankaran, J.K., Some new results regarding spikes and a heuristic for spike construction (2) 171-195
Sekitani, K. and Y. Yamamoto, A recursive algorithm for finding the minimum norm point
in a polytope and a pair of closest points in two polytopes (2) 233-249
Shamir, R., see I. Adler (1) 3% 52
Todd, M.J., see L.G. Khachiyan (2) 137-159
400 Author Index Volume 61
Tretter, M.J., see J.J. Dinkel (3) 377-384
Vicente, L.N., see P.H. Calamai (2) 215-231
Vlerk, M.H. van der, see F.V. Louveaux (3) 301-325
Wallace, S.W. and T. Yan, Bounding multi-stage stochastic programs form above (1) 111-129
Wets, R.J.-B., see H. Attouch (2) 197-214
Wu, J.H., M. Florian and P. Marcotte, A general descent framework for the monotone
variational inequality problem (3) 281-300
Yamamoto, Y., see K. Sekitani (2) 233-249
Yan, T., see S.W. Wallace (1) 111-129
Yuan, Y.-x., see J. Nocedai (1) 19- 37
Zhou, X., F.S. Mokhtarian and S. Zlobec, A simple constraint qualification in convex pro-
gramming (3) 385-397
Zlobec, S. see X. Zhou (3) 385-397