Mathematical Programming, Volume 65
Volume 65, 1994
- Siegfried Helbig: Duality in disjunctive programming via vector optimization. 21-41
- Masakazu Kojima, Toshihito Noma, Akiko Yoshise: Global convergence in infeasible-interior-point algorithms. 43-72
- James Renegar: Some perturbation theory for linear programming. 73-91
- Sjur Didrik Flåm, Alberto Seeger: Solving cone-constrained convex programs by differential inclusions. 107-121
- A. S. Lewis: Facial reduction in partially finite convex programming. 123-138
- William H. Cunningham, Jan Green-Krótki: A separation algorithm for the matchable set polytope. 139-150
- Baichun Xiao, Patrick T. Harker: A nonsmooth Newton method for variational inequalities, I: theory. 151-194
- Baichun Xiao, Patrick T. Harker: A nonsmooth Newton method for variational inequalities, II: numerical results. 195-216
- Michael J. Todd: Interior-point algorithms for semi-infinite programming. 217-245
- B. Curtis Eaves, Uriel G. Rothblum: Formulation of linear problems and solution by a universal machine. 263-309
- Igor Averbakh: Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms. 311-330
- Athanasios Migdalas: A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods. 331-345
- Osman Güler: Limiting behavior of weighted central paths in linear programming. 347-363
- Karen T. Medhi: A two-stage successive overrelaxation algorithm for solving the symmetric linear complementarity problem. 365-380
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team