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

• 2019
• 
  Yossi Arjevani, Ohad Shamir, Ron Shiff:
  Oracle complexity of second-order methods for smooth convex optimization. Math. Program. 178(1-2): 327-360 (2019)
• 
  Sebastian Banert, Radu Ioan Bot:
  A general double-proximal gradient algorithm for d.c. programming. Math. Program. 178(1-2): 301-326 (2019)
• 
  Amir Beck, Nadav Hallak:
  Optimization problems involving group sparsity terms. Math. Program. 178(1-2): 39-67 (2019)
• 
  Stefania Bellavia, Jacek Gondzio, Margherita Porcelli:
  An inexact dual logarithmic barrier method for solving sparse semidefinite programs. Math. Program. 178(1-2): 109-143 (2019)
• 
  Michele Conforti, Laurence A. Wolsey:
  "Facet" separation with one linear program. Math. Program. 178(1-2): 361-380 (2019)
• 
  Ying Cui, Defeng Sun, Kim-Chuan Toh:
  On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming. Math. Program. 178(1-2): 381-415 (2019)
• 
  Dmitriy Drusvyatskiy, Courtney Paquette:
  Efficiency of minimizing compositions of convex functions and smooth maps. Math. Program. 178(1-2): 503-558 (2019)
• 
  Satoru Fujishige, Yoshio Sano, Ping Zhan:
  Submodular optimization views on the random assignment problem. Math. Program. 178(1-2): 485-501 (2019)
• 
  Gabriel Haeser, Hongcheng Liu, Yinyu Ye:
  Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary. Math. Program. 178(1-2): 263-299 (2019)
• 
  Jinhak Kim, Mohit Tawarmalani, Jean-Philippe P. Richard:
  On cutting planes for cardinality-constrained linear programs. Math. Program. 178(1-2): 417-448 (2019)
• 
  Huikang Liu, Anthony Man-Cho So, Weijie Wu:
  Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods. Math. Program. 178(1-2): 215-262 (2019)
• 
  Hongcheng Liu, Xue Wang, Tao Yao, Runze Li, Yinyu Ye:
  Sample average approximation with sparsity-inducing penalty for high-dimensional stochastic programming. Math. Program. 178(1-2): 69-108 (2019)
• 
  Jiawang Nie:
  Tight relaxations for polynomial optimization and Lagrange multiplier expressions. Math. Program. 178(1-2): 1-37 (2019)
• 
  Martin Schmidt, Mathias Sirvent, Winnifried Wollner:
  A decomposition method for MINLPs with Lipschitz continuous nonlinearities. Math. Program. 178(1-2): 449-483 (2019)
• 
  Tianxiao Sun, Quoc Tran-Dinh:
  Generalized self-concordant functions: a recipe for Newton-type methods. Math. Program. 178(1-2): 145-213 (2019)