• 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 22 matches

• 2015
• 
  Ashwin Arulselvan:
  On the geometric rank of matching polytope. Math. Program. 152(1-2): 189-200 (2015)
• 
  Yair Censor, Daniel Reem:
  Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods. Math. Program. 152(1-2): 339-380 (2015)
• 
  Nikolaos Chatzipanagiotis, Darinka Dentcheva, Michael M. Zavlanos:
  An augmented Lagrangian method for distributed optimization. Math. Program. 152(1-2): 405-434 (2015)
• 
  Gérard Cornuéjols, Laurence A. Wolsey, Sercan Yildiz:
  Sufficiency of cut-generating functions. Math. Program. 152(1-2): 643-651 (2015)
• 
  Frank E. Curtis, Hao Jiang, Daniel P. Robinson:
  An adaptive augmented Lagrangian method for large-scale constrained optimization. Math. Program. 152(1-2): 201-245 (2015)
• 
  Youssef Diouane, Serge Gratton, Luís Nunes Vicente:
  Globally convergent evolution strategies. Math. Program. 152(1-2): 467-490 (2015)
• 
  Dmitriy Drusvyatskiy, Stephen A. Vavasis, Henry Wolkowicz:
  Extreme point inequalities and geometry of the rank sparsity ball. Math. Program. 152(1-2): 521-544 (2015)
• 
  Angelos Georghiou, Wolfram Wiesemann, Daniel Kuhn:
  Generalized decision rule approximations for stochastic programming via liftings. Math. Program. 152(1-2): 301-338 (2015)
• 
  Jacek Gondzio, Pablo González-Brevis:
  A new warmstarting strategy for the primal-dual column generation method. Math. Program. 152(1-2): 113-146 (2015)
• 
  Geovani Nunes Grapiglia, Jin Yun Yuan, Ya-Xiang Yuan:
  On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization. Math. Program. 152(1-2): 491-520 (2015)
• 
  Anupam Gupta, Jochen Könemann, Stefano Leonardi, R. Ravi, Guido Schäfer:
  Efficient cost-sharing mechanisms for prize-collecting problems. Math. Program. 152(1-2): 147-188 (2015)
• 
  Grani Adiwena Hanasusanto, Daniel Kuhn, Stein W. Wallace, Steve Zymler:
  Distributionally robust multi-item newsvendor problems with multimodal demand distributions. Math. Program. 152(1-2): 1-32 (2015)
• 
  Zaïd Harchaoui, Anatoli B. Juditsky, Arkadi Nemirovski:
  Conditional gradient algorithms for norm-regularized smooth convex optimization. Math. Program. 152(1-2): 75-112 (2015)
• 
  Alexey F. Izmailov, E. I. Uskov:
  Attraction of Newton method to critical Lagrange multipliers: fully quadratic case. Math. Program. 152(1-2): 33-73 (2015)
• 
  Václav Kozmík, David P. Morton:
  Evaluating policies in risk-averse multi-stage stochastic programming. Math. Program. 152(1-2): 275-300 (2015)
• 
  Jean B. Lasserre:
  A generalization of Löwner-John's ellipsoid theorem. Math. Program. 152(1-2): 559-591 (2015)
• 
  Ehud Lehrer, Roee Teper:
  Sandwich games. Math. Program. 152(1-2): 545-557 (2015)
• 
  Zhaosong Lu, Lin Xiao:
  On the complexity analysis of randomized block-coordinate descent methods. Math. Program. 152(1-2): 615-642 (2015)
• 
  Takanori Maehara, Kazuo Murota:
  A framework of discrete DC programming by discrete convex analysis. Math. Program. 152(1-2): 435-466 (2015)
• 
  Alberto Marchetti-Spaccamela, Cyriel Rutten, Suzanne van der Ster, Andreas Wiese:
  Assigning sporadic tasks to unrelated machines. Math. Program. 152(1-2): 247-274 (2015)
• 
  Yurii E. Nesterov:
  Universal gradient methods for convex optimization problems. Math. Program. 152(1-2): 381-404 (2015)
• 
  Jiming Peng, Tao Zhu:
  A nonlinear semidefinite optimization relaxation for the worst-case linear optimization under uncertainties. Math. Program. 152(1-2): 593-614 (2015)