| 941 | -- | 965 | Ernesto G. Birgin, José Mario Martínez. Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization |
| 967 | -- | 979 | Serge Gratton, Vincent Malmedy, Philippe L. Toint. Using approximate secant equations in limited memory methods for multilevel unconstrained optimization |
| 981 | -- | 999 | Junxiang Li, Limei Yan, Shudong Li, Jiazhen Huo. Inexact trust region PGC method for large sparse unconstrained optimization |
| 1001 | -- | 1036 | Luke B. Winternitz, Stacey O. Nicholls, André L. Tits, Dianne P. O'Leary. A constraint-reduced variant of Mehrotra's predictor-corrector algorithm |
| 1037 | -- | 1063 | Jia Wu, Jein-Shan Chen. A proximal point algorithm for the monotone second-order cone complementarity problem |
| 1065 | -- | 1088 | Yair Censor, Wei Chen, Patrick L. Combettes, Ran Davidi, Gabor T. Herman. On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints |
| 1089 | -- | 1095 | Nicholas I. M. Gould. How good are extrapolated bi-projection methods for linear feasibility problems? |
| 1097 | -- | 1117 | Le Thi Hoai An, Mahdi Moeini, Tao Pham Dinh, Joaquim Júdice. A DC programming approach for solving the symmetric Eigenvalue Complementarity Problem |
| 1119 | -- | 1135 | Pedro Gajardo, Alberto Seeger. Reconstructing a matrix from a partial sampling of Pareto eigenvalues |
| 1137 | -- | 1161 | F. Gerlich, A. M. Giese, Jan H. Maruhn, Ekkehard W. Sachs. Parameter identification in financial market models with a feasible point SQP algorithm |
| 1163 | -- | 1171 | Xiangli Li, Hongwei Liu, Xiuyun Zheng. Non-monotone projection gradient method for non-negative matrix factorization |
| 1173 | -- | 1210 | Stacey L. Faulkenberg, Margaret M. Wiecek. Generating equidistant representations in biobjective programming |
| 1211 | -- | 1229 | J. Cole Smith, Elif Ulusal, Illya V. Hicks. A combinatorial optimization algorithm for solving the branchwidth problem |
| 1231 | -- | 1252 | Nicolas Zufferey, Olivier Labarthe, David Schindl. Heuristics for a project management problem with incompatibility and assignment costs |
| 1253 | -- | 1274 | Gio K. Kao, Edward C. Sewell, Sheldon H. Jacobson, Shane N. Hall. i scheduling problem |
| 1275 | -- | 1295 | Jianlin Jiang, Xiaoming Yuan. A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand |
| 1297 | -- | 1317 | Rafael Martí, Gerhard Reinelt, Abraham Duarte. A benchmark library and a comparison of heuristic methods for the linear ordering problem |
| 1319 | -- | 1343 | Eduardo Casas, Mariano Mateos. Numerical approximation of elliptic control problems with finitely many pointwise constraints |
| 1345 | -- | 1373 | Karl Kunisch, Daniel Wachsmuth. Path-following for optimal control of stationary variational inequalities |
| 1375 | -- | 1396 | Patrizia Beraldi, Maria Elena Bruni, Antonio Violi. Capital rationing problems under uncertainty and risk |
| 1397 | -- | 1408 | Michal Cerný, Milan Hladík. c-optimality in experimental design |