Mathematical Programming, Volume 66

Volume 66, 1994

• Abderrahim Jourani:
  Qualification conditions for multivalued functions in Banach spaces with applications to nonsmooth vector optimization problems. 1-23
  
• Liqun Qi, Jie Sun:
  A trust region algorithm for minimization of locally Lipschitzian functions. 25-43
  
• Dirk Siegel:
  Modifying the BFGS update by a new column scaling technique. 45-78
  
• Deepankar Medhi:
  Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs. 79-101
  
• Fabrice Gamboa, Elisabeth Gassiat:
  The maximum entropy method on the mean: Applications to linear programming and superresolution. 103-122
  
• Irvin Lustig, Roy E. Marsten, David F. Shanno:
  Computational experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming. 123-135
  
• Bingsheng He:
  A new method for a class of linear variational inequalities. 137-144
  
• Levent Tunçel:
  Constant potential primal-dual algorithms: A framework. 145-159
  
• Diethard Pallaschke, Ryszard Urbanski:
  Reduction of quasidifferentials and minimal representations. 161-180
  
• Claus-Peter Schnorr, M. Euchner:
  Lattice basis reduction: Improved practical algorithms and solving subset sum problems. 181-199
  
• Arie Tamir:
  A distance constrained p-facility location problem on the real line. 201-204
  
• P. Barcia, J. D. Coelho:
  A bound-improving approach to discrete programming problems. 205-209
  
• Julie Falkner, Franz Rendl, Henry Wolkowicz:
  A computational study of graph partitioning. 211-239
  
• Olvi L. Mangasarian, J. Ren:
  New improved error bounds for the linear complementarity problem. 241-255
  
• Kim Allen Andersen:
  Characterizing consistency in probabilistic logic for a class of Horn clauses. 257-271
  
• Imre Bárány, Roger Howe, Herbert E. Scarf:
  The complex of maximal lattice free simplices. 273-281
  
• Ingrid Bongartz, Paul H. Calamai, Andrew R. Conn:
  A projection method for l_p norm location-allocation problems. 283-312
  
• Alexander V. Karzanov:
  Minimum cost multiflows in undirected networks. 313-325
  
• Roger Fletcher, Sven Leyffer:
  Solving mixed integer nonlinear programs by outer approximation. 327-349
  
• R. Hirabayashi, Hubertus Th. Jongen, Masayuki Shida:
  Stability for linearly constrained optimization problems. 351-360
  
• Yin Zhang, Detong Zhang:
  Superlinear convergence of infeasible-interior-point methods for linear programming. 361-377
  
• L. R. Huang, K. F. Ng:
  Second-order necessary and sufficient conditions in nonsmooth optimization. 379-402
  
• J. Orestes Cerdeira:
  Matroids and a forest cover problem. 403-405
  

Last update Thu May 23 19:16:52 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page