Volume 65,
1994
- J. E. Martínez-Legaz, A. Seeger:
A general cone decomposition theory based on efficiency.
1-20 BibTeX
- Siegfried Helbig:
Duality in disjunctive programming via vector optimization.
21-41 BibTeX
- Masakazu Kojima, Toshihito Noma, Akiko Yoshise:
Global convergence in infeasible-interior-point algorithms.
43-72 BibTeX
- James Renegar:
Some perturbation theory for linear programming.
73-91 BibTeX
- Péter L. Erdös, László A. Székely:
On weighted multiway cuts in trees.
93-105 BibTeX
- Sjur Didrik Flåm, Alberto Seeger:
Solving cone-constrained convex programs by differential inclusions.
107-121 BibTeX
- A. S. Lewis:
Facial reduction in partially finite convex programming.
123-138 BibTeX
- William H. Cunningham, Jan Green-Krótki:
A separation algorithm for the matchable set polytope.
139-150 BibTeX
- Baichun Xiao, Patrick T. Harker:
A nonsmooth Newton method for variational inequalities, I: theory.
151-194 BibTeX
- Baichun Xiao, Patrick T. Harker:
A nonsmooth Newton method for variational inequalities, II: numerical results.
195-216 BibTeX
- Michael J. Todd:
Interior-point algorithms for semi-infinite programming.
217-245 BibTeX
- R. B. Mifflin, J. L. Nazareth:
The least prior deviation quasi-Newton update.
247-261 BibTeX
- B. Curtis Eaves, Uriel G. Rothblum:
Formulation of linear problems and solution by a universal machine.
263-309 BibTeX
- Igor Averbakh:
Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms.
311-330 BibTeX
- Athanasios Migdalas:
A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods.
331-345 BibTeX
- Osman Güler:
Limiting behavior of weighted central paths in linear programming.
347-363 BibTeX
- Karen T. Medhi:
A two-stage successive overrelaxation algorithm for solving the symmetric linear complementarity problem.
365-380 BibTeX
Copyright © Sun May 17 00:14:02 2009
by Michael Ley (ley@uni-trier.de)
