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

• 2006
• 
  Keyvan Amini, Nezam Mahdavi-Amiri:
  Solving rank one perturbed linear Diophantine systems by the ABS method. Optim. Methods Softw. 21(5): 819-831 (2006)
• 
  F. S. Bai, Zhi-You Wu, D. L. Zhu:
  Lower order calmness and exact penalty function. Optim. Methods Softw. 21(4): 515-525 (2006)
• 
  Steven J. Benson, Todd S. Munson:
  Flexible complementarity solvers for large-scale applications. Optim. Methods Softw. 21(1): 155-168 (2006)
• 
  Alfio Borzì, Karl Kunisch:
  A globalization strategy for the multigrid solution of elliptic optimal control problems. Optim. Methods Softw. 21(3): 445-459 (2006)
• 
  Regina Sandra Burachik, Claudia A. Sagastizábal, Susana Scheimberg:
  An inexact method of partial inverses and a parallel bundle method. Optim. Methods Softw. 21(3): 385-400 (2006)
• 
  Samuel Burer, Changhui Choi:
  Computational enhancements in low-rank semidefinite programming. Optim. Methods Softw. 21(3): 493-512 (2006)
• 
  Joo-Siong Chai, Kim-Chuan Toh:
  Computation of condition numbers for linear programming problems using Peña's method. Optim. Methods Softw. 21(3): 419-443 (2006)
• 
  Johnny Tak Wai Cheng, Shuzhong Zhang:
  On implementation of a self-dual embedding method for convex programming. Optim. Methods Softw. 21(1): 75-103 (2006)
• 
  Zsolt Csizmadia, Tibor Illés:
  New criss-cross type algorithms for linear complementarity problems with sufficient matrices. Optim. Methods Softw. 21(2): 247-266 (2006)
• 
  Indraneel Das:
  An active set quadratic programming algorithm for real-time model predictive control. Optim. Methods Softw. 21(5): 833-849 (2006)
• 
  Antoine Deza, Eissa Nematollahi, M. Reza Peyghami, Tamás Terlaky:
  The central path visits all the vertices of the Klee-Minty cube. Optim. Methods Softw. 21(5): 851-865 (2006)
• 
  Fasma Diele, Carmela Marangi, Stefania Ragni:
  Coupling quadrature and continuous Runge-Kutta methods for optimal control problems. Optim. Methods Softw. 21(6): 961-975 (2006)
• 
  Jean-Pierre Dussault, Benoit Hamelin:
  Robust descent in differentiable optimization using automatic finite differences. Optim. Methods Softw. 21(5): 769-777 (2006)
• 
  Etienne Emmrich, Horst Schmitt:
  Numerical treatment of a class of optimal control problems arising in economics. Optim. Methods Softw. 21(5): 747-767 (2006)
• 
  Karsten Eppler, Helmut Harbrecht:
  Second-order shape optimization using wavelet BEM. Optim. Methods Softw. 21(1): 135-153 (2006)
• 
  Mohammad Hadi Farahi, Hamed Hashemi Mehne, Akbar Hashemi Borzabadi:
  Wing drag minimization by using measure theory. Optim. Methods Softw. 21(2): 169-177 (2006)
• 
  Leonid Faybusovich, Thanasak Mouktonglang, Takashi Tsuchiya:
  Implementation of infinite-dimensional interior-point method for solving multi-criteria linear-quadratic control problem. Optim. Methods Softw. 21(2): 315-341 (2006)
• 
  Katsuki Fujisawa, Mituhiro Fukuda, Kazuhide Nakata:
  Preprocessing sparse semidefinite programs via matrix completion. Optim. Methods Softw. 21(1): 17-39 (2006)
• 
  Tobias Gänzler, Stefan Volkwein, Martin Weiser:
  SQP methods for parameter identification problems arising in hyperthermia. Optim. Methods Softw. 21(6): 869-887 (2006)
• 
  Rafail N. Gasimov, Gürkan Öztürk:
  Separation via polyhedral conic functions. Optim. Methods Softw. 21(4): 527-540 (2006)
• 
  Ilia Gherman, Volker Schulz, J. T. Betts:
  Optimal flight trajectories for the validation of aerodynamic models. Optim. Methods Softw. 21(6): 889-900 (2006)
• 
  Juan A. Gómez, Walter Gómez:
  Cutting plane algorithms for robust conic convex optimization problems. Optim. Methods Softw. 21(5): 779-803 (2006)
• 
  Lixing Han, Michael Neumann:
  Effect of dimensionality on the Nelder-Mead simplex method. Optim. Methods Softw. 21(1): 1-16 (2006)
• 
  Marc Daniel Haunschild, Sebastian Aljoscha Wahl, Bernd Freisleben, Wolfgang Wiechert:
  A general framework for large-scale model selection. Optim. Methods Softw. 21(6): 901-917 (2006)
• 
  Kaj Holmberg, Krzysztof C. Kiwiel:
  Mean value cross decomposition for nonlinear convex problems. Optim. Methods Softw. 21(3): 401-417 (2006)
• 
  Jia-Yen Huang:
  New search algorithm for solving the maintenance scheduling problem for a family of machines. Optim. Methods Softw. 21(3): 461-477 (2006)
• 
  Vaithilingam Jeyakumar, John T. Ormerod, Robert S. Womersley:
  Knowledge-based semidefinite linear programming classifiers. Optim. Methods Softw. 21(5): 693-706 (2006)
• 
  P. Kaelo, M. M. Ali:
  Probabilistic adaptations of point generation schemes in some global optimization algorithms. Optim. Methods Softw. 21(3): 343-357 (2006)
• 
  R. Baker Kearfott:
  Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization. Optim. Methods Softw. 21(5): 715-731 (2006)
• 
  Anthony J. Kearsley:
  Matrix-free algorithm for the large-scale constrained trust-region subproblem. Optim. Methods Softw. 21(2): 233-245 (2006)

skipping 29 more matches