• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 20 matches

• 1994
• 
  T. Bannert:
  A trust region algorithm for nonsmooth optimization. Math. Program. 67: 247-264 (1994)
• 
  J. Randall Brown:
  Bounded knapsack sharing. Math. Program. 67: 343-382 (1994)
• 
  Thomas F. Coleman, Yuying Li:
  On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds. Math. Program. 67: 189-224 (1994)
• 
  Roberto Cominetti, Jaime San Martín:
  Asymptotic analysis of the exponential penalty trajectory in linear programming. Math. Program. 67: 169-187 (1994)
• 
  Andrew R. Conn, Nicholas I. M. Gould, Philippe L. Toint:
  A note on exploiting structure when using slack variables. Math. Program. 67: 89-97 (1994)
• 
  Roland W. Freund, Florian Jarre:
  An interior-point method for fractional programs with convex constraints. Math. Program. 67: 407-440 (1994)
• 
  Faruk Güder, James G. Morris:
  Optimal objective function approximation for separable convex quadratic programming. Math. Program. 67: 133-142 (1994)
• 
  Julia L. Higle, Suvrajeet Sen:
  Finite master programs in regularized stochastic decomposition. Math. Program. 67: 143-168 (1994)
• 
  Zhi-Quan Luo, Jong-Shi Pang:
  Error bounds for analytic systems and their applications. Math. Program. 67: 1-28 (1994)
• 
  Shinji Mizuno:
  Polynomiality of infeasible-interior-point algorithms for linear programming. Math. Program. 67: 109-119 (1994)
• 
  Hiroshi Nagamochi, Tadashi Ono, Toshihide Ibaraki:
  Implementing an efficient minimum capacity cut algorithm. Math. Program. 67: 325-341 (1994)
• 
  Jean-Paul Penot:
  Optimality conditions in mathematical programming and composite optimization. Math. Program. 67: 225-245 (1994)
• 
  Yves Pochet, Laurence A. Wolsey:
  Polyhedra for lot-sizing with Wagner-Whitin costs. Math. Program. 67: 297-323 (1994)
• 
  Florian A. Potra:
  A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points. Math. Program. 67: 383-406 (1994)
• 
  M. van Rooyen, X. Zhou, Sanjo Zlobec:
  A saddle-point characterization of Pareto optima. Math. Program. 67: 77-88 (1994)
• 
  Alexander Shapiro:
  Quantitative stability in stochastic programming. Math. Program. 67: 99-108 (1994)
• 
  Kalyan T. Talluri, Donald K. Wagner:
  On the k-cut subgraph polytope. Math. Program. 67: 121-132 (1994)
• 
  Stephen J. Wright:
  An infeasible-interior-point algorithm for linear complementarity problems. Math. Program. 67: 29-51 (1994)
• 
  Margaret H. Wright:
  Some properties of the Hessian of the logarithmic barrier function. Math. Program. 67: 265-295 (1994)
• 
  Ciyou Zhu:
  Solving large-scale minimax problems with the primal-dual steepest descent algorithm. Math. Program. 67: 53-76 (1994)