1. Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization

   • Ernesto G. Birgin
   • J. M. Martínez

   OriginalPaper 19 February 2011 Pages: 941 - 965

2. Using approximate secant equations in limited memory methods for multilevel unconstrained optimization

   • Serge Gratton
   • Vincent Malmedy
   • Philippe L. Toint

   OriginalPaper 03 February 2011 Pages: 967 - 979

3. Inexact trust region PGC method for large sparse unconstrained optimization

   • Junxiang Li
   • Limei Yan
   • Jiazhen Huo

   OriginalPaper 03 December 2010 Pages: 981 - 999

4. A constraint-reduced variant of Mehrotra’s predictor-corrector algorithm

   • Luke B. Winternitz
   • Stacey O. Nicholls
   • Dianne P. O’Leary

   OriginalPaper 19 January 2011 Pages: 1001 - 1036

5. A proximal point algorithm for the monotone second-order cone complementarity problem

   • Jia Wu
   • Jein-Shan Chen

   OriginalPaper 01 March 2011 Pages: 1037 - 1063

6. On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints

   • Yair Censor
   • Wei Chen
   • Gabor T. Herman

   OriginalPaper 17 March 2011 Pages: 1065 - 1088

7. How good are extrapolated bi-projection methods for linear feasibility problems?

   • Nicholas I. M. Gould

   OriginalPaper 25 May 2011 Pages: 1089 - 1095

8. A DC programming approach for solving the symmetric Eigenvalue Complementarity Problem

   • Hoai An Le Thi
   • Mahdi Moeini
   • Joaquim Judice

   OriginalPaper 22 December 2010 Pages: 1097 - 1117

9. Reconstructing a matrix from a partial sampling of Pareto eigenvalues

   • Pedro Gajardo
   • Alberto Seeger

   OriginalPaper 07 January 2011 Pages: 1119 - 1135

10. Parameter identification in financial market models with a feasible point SQP algorithm

    • F. Gerlich
    • A. M. Giese
    • E. W. Sachs

    OriginalPaper 07 December 2010 Pages: 1137 - 1161

11. Non-monotone projection gradient method for non-negative matrix factorization

    • Xiangli Li
    • Hongwei Liu
    • Xiuyun Zheng

    OriginalPaper 21 December 2010 Pages: 1163 - 1171

12. Generating equidistant representations in biobjective programming

    • Stacey L. Faulkenberg
    • Margaret M. Wiecek

    OriginalPaper 05 April 2011 Pages: 1173 - 1210

13. A combinatorial optimization algorithm for solving the branchwidth problem

    • J. Cole Smith
    • Elif Ulusal
    • Illya V. Hicks

    OriginalPaper 15 February 2011 Pages: 1211 - 1229

14. Heuristics for a project management problem with incompatibility and assignment costs

    • Nicolas Zufferey
    • Olivier Labarthe
    • David Schindl

    OriginalPaper 02 December 2010 Pages: 1231 - 1252

15. New dominance rules and exploration strategies for the 1|r _i |∑U _i scheduling problem

    • Gio K. Kao
    • Edward C. Sewell
    • Shane N. Hall

    OriginalPaper 02 December 2010 Pages: 1253 - 1274

16. A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand

    • Jianlin Jiang
    • Xiaoming Yuan

    OriginalPaper 13 January 2011 Pages: 1275 - 1295

17. A benchmark library and a comparison of heuristic methods for the linear ordering problem

    • Rafael Martí
    • Gerhard Reinelt
    • Abraham Duarte

    OriginalPaper 05 January 2011 Pages: 1297 - 1317

18. Numerical approximation of elliptic control problems with finitely many pointwise constraints

    • Eduardo Casas
    • Mariano Mateos

    OriginalPaper 04 February 2011 Pages: 1319 - 1343

19. Path-following for optimal control of stationary variational inequalities

    • Karl Kunisch
    • Daniel Wachsmuth

    OriginalPaper 10 March 2011 Pages: 1345 - 1373

20. Capital rationing problems under uncertainty and risk

    • Patrizia Beraldi
    • Maria Elena Bruni
    • Antonio Violi

    OriginalPaper 05 January 2011 Pages: 1375 - 1396

21. Two complexity results on c-optimality in experimental design

    • Michal Černý
    • Milan Hladík

    OriginalPaper 25 November 2010 Pages: 1397 - 1408