Volume 61,
1993
- Michele Conforti, M. R. Rao:
Testing balancedness and perfection of linear matrices.
1-18 BibTeX
- Jorge Nocedal, Ya-Xiang Yuan:
Analysis of a self-scaling quasi-Newton method.
19-37 BibTeX
- Ilan Adler, Ron Shamir:
A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio.
39-52 BibTeX
- Yves Crama:
Concave extensions for nonlinear 0-1 maximization problems.
53-60 BibTeX
- Arnon Boneh, Shahar Boneh, Richard J. Caron:
Constraint classification in mathematical programming.
61-73 BibTeX
- Le Dung Muu:
An algorithm for solving convex programs with an additional convex-concave constraint.
75-87 BibTeX
- S. Bolintineanu:
Minimization of a quasi-concave function over an efficient set.
89-110 BibTeX
- Stein W. Wallace, Tiecheng Yan:
Bounding multi-stage stochastic programs from above.
111-129 BibTeX
- G. S. R. Murthy, T. Parthasarathy, G. Ravindran:
A copositive Q-matrix which is no R0.
131-135 BibTeX
- Leonid Khachiyan, Michael J. Todd:
On the complexity of approximating the maximal inscribed ellipsoid for a polytope.
137-159 BibTeX
- Donald Goldfarb, Shucheng Liu:
An O(n3L) primal-dual potential reduction algorithm for solving convex quadratic programs.
161-170 BibTeX
- Jayaram K. Sankaran:
Some new results regarding spikes and a heuristic for spike construction.
171-195 BibTeX
- Hedy Attouch, Roger J.-B. Wets:
Quantitative stability of variational systems: III. epsilon-approximate solutions.
197-214 BibTeX
- Paul H. Calamai, Luís N. Vicente, Joaquim Júdice:
A new technique for generating quadratic programming test problems.
215-231 BibTeX
- Kazuyuki Sekitani, Yoshitsugu Yamamoto:
A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes.
233-249 BibTeX
- Jonathan M. Borwein:
On the failure of maximum entropy reconstruction for Fredholm equations and other infinite systems.
251-261 BibTeX
- Masakazu Kojima, Nimrod Megiddo, Shinji Mizuno:
A primal-dual infeasible-interior-point algorithm for linear programming.
263-280 BibTeX
- Jia Hao Wu, Michael Florian, Patrice Marcotte:
A general descent framework for the monotone variational inequality problem.
281-300 BibTeX
- François V. Louveaux, Maarten H. van der Vlerk:
Stochastic programming with simple integer recourse.
301-325 BibTeX
- B. Curtis Eaves, Uriel G. Rothblum:
A class of "onto" multifunctions.
327-343 BibTeX
- G. S. R. Murthy:
A note on sufficient conditions for Q0 and Q0 AND P0 matrices.
345-349 BibTeX
- Jianming Miao:
Ky Fan's N-matrices and linear complementarity problems.
351-356 BibTeX
- Paul Armand:
Finding all maximal efficient faces in multiobjective linear programming.
357-375 BibTeX
- John J. Dinkel, Marietta J. Tretter:
Characterization of perturbed mathematical programs and interval analysis.
377-384 BibTeX
- X. Zhou, F. Sharifi Mokhtarian, S. Zlobec:
A simple constraint qualification in convex programming.
385-397 BibTeX
Copyright © Sun May 17 00:14:01 2009
by Michael Ley (ley@uni-trier.de)