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

• 2017
• 
  Sergio González Andrade:
  A preconditioned descent algorithm for variational inequalities of the second kind involving the p-Laplacian operator. Comput. Optim. Appl. 66(1): 123-162 (2017)
• 
  Elvira Antal, Tamás Vinkó:
  Modeling max-min fair bandwidth allocation in BitTorrent communities. Comput. Optim. Appl. 66(2): 383-400 (2017)
• 
  Naohiko Arima, Sunyoung Kim, Masakazu Kojima, Kim-Chuan Toh:
  A robust Lagrangian-DNN method for a class of quadratic optimization problems. Comput. Optim. Appl. 66(3): 453-479 (2017)
• 
  Johannes Brust, Jennifer B. Erway, Roummel F. Marcia:
  On solving L-SR1 trust-region subproblems. Comput. Optim. Appl. 66(2): 245-266 (2017)
• 
  Xingju Cai, Deren Han, Xiaoming Yuan:
  On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function. Comput. Optim. Appl. 66(1): 39-73 (2017)
• 
  Huiping Cao, Dong-Hui Li:
  Partitioned quasi-Newton methods for sparse nonlinear equations. Comput. Optim. Appl. 66(3): 481-505 (2017)
• 
  Liang Chen, Defeng Sun, Kim-Chuan Toh:
  A note on the convergence of ADMM for linearly constrained convex optimization problems. Comput. Optim. Appl. 66(2): 327-343 (2017)
• 
  Chao Ding, Hou-Duo Qi:
  Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation. Comput. Optim. Appl. 66(1): 187-218 (2017)
• 
  Reza Eghbali, Maryam Fazel:
  Decomposable norm minimization with proximal-gradient homotopy algorithm. Comput. Optim. Appl. 66(2): 345-381 (2017)
• 
  Jinyan Fan, Anwa Zhou:
  A semidefinite algorithm for completely positive tensor decomposition. Comput. Optim. Appl. 66(2): 267-283 (2017)
• 
  Severino F. Galán:
  Simple decentralized graph coloring. Comput. Optim. Appl. 66(1): 163-185 (2017)
• 
  Dang Van Hieu, Pham Ky Anh, Le Dung Muu:
  Modified hybrid projection methods for finding common solutions to variational inequality problems. Comput. Optim. Appl. 66(1): 75-96 (2017)
• 
  Zheng-Hai Huang, Liqun Qi:
  Formulating an n-person noncooperative game as a tensor complementarity problem. Comput. Optim. Appl. 66(3): 557-576 (2017)
• 
  K. Lakshmanan, Shalabh Bhatnagar:
  Quasi-Newton smoothed functional algorithms for unconstrained and constrained simulation optimization. Comput. Optim. Appl. 66(3): 533-556 (2017)
• 
  Ricardo M. Lima, Ignacio E. Grossmann:
  On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study. Comput. Optim. Appl. 66(1): 1-37 (2017)
• 
  Meijiao Liu, Yong-Jin Liu:
  Fast algorithm for singly linearly constrained quadratic programs with box-like constraints. Comput. Optim. Appl. 66(2): 309-326 (2017)
• 
  Ali Mohammad Nezhad, Tamás Terlaky:
  A polynomial primal-dual affine scaling algorithm for symmetric conic optimization. Comput. Optim. Appl. 66(3): 577-600 (2017)
• 
  Sanja Rapajic, Zoltán Papp:
  A nonmonotone Jacobian smoothing inexact Newton method for NCP. Comput. Optim. Appl. 66(3): 507-532 (2017)
• 
  Maziar Salahi, Akram Taati, Henry Wolkowicz:
  Local nonglobal minima for solving large-scale extended trust-region subproblems. Comput. Optim. Appl. 66(2): 223-244 (2017)
• 
  Quoc Tran-Dinh:
  Adaptive smoothing algorithms for nonsmooth composite convex minimization. Comput. Optim. Appl. 66(3): 425-451 (2017)
• 
  Kenji Ueda, Nobuo Yamashita:
  Erratum to: A regularized Newton method without line search for unconstrained optimization. Comput. Optim. Appl. 66(1): 219-222 (2017)
• 
  Wei Wan, Lorenz T. Biegler:
  Structured regularization for barrier NLP solvers. Comput. Optim. Appl. 66(3): 401-424 (2017)
• 
  Na Zhao, Qingzhi Yang, Yajun Liu:
  Computing the generalized eigenvalues of weakly symmetric tensors. Comput. Optim. Appl. 66(2): 285-307 (2017)
• 
  Jing Zhou, Shu-Cherng Fang, Wenxun Xing:
  Conic approximation to quadratic optimization with linear complementarity constraints. Comput. Optim. Appl. 66(1): 97-122 (2017)