Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization Ernesto G. BirginJ. M. Martínez OriginalPaper 19 February 2011 Pages: 941 - 965
Using approximate secant equations in limited memory methods for multilevel unconstrained optimization Serge GrattonVincent MalmedyPhilippe L. Toint OriginalPaper 03 February 2011 Pages: 967 - 979
Inexact trust region PGC method for large sparse unconstrained optimization Junxiang LiLimei YanJiazhen Huo OriginalPaper 03 December 2010 Pages: 981 - 999
A constraint-reduced variant of Mehrotra’s predictor-corrector algorithm Luke B. WinternitzStacey O. NichollsDianne P. O’Leary OriginalPaper 19 January 2011 Pages: 1001 - 1036
A proximal point algorithm for the monotone second-order cone complementarity problem Jia WuJein-Shan Chen OriginalPaper 01 March 2011 Pages: 1037 - 1063
On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints Yair CensorWei ChenGabor T. Herman OriginalPaper 17 March 2011 Pages: 1065 - 1088
How good are extrapolated bi-projection methods for linear feasibility problems? Nicholas I. M. Gould OriginalPaper 25 May 2011 Pages: 1089 - 1095
A DC programming approach for solving the symmetric Eigenvalue Complementarity Problem Hoai An Le ThiMahdi MoeiniJoaquim Judice OriginalPaper 22 December 2010 Pages: 1097 - 1117
Reconstructing a matrix from a partial sampling of Pareto eigenvalues Pedro GajardoAlberto Seeger OriginalPaper 07 January 2011 Pages: 1119 - 1135
Parameter identification in financial market models with a feasible point SQP algorithm F. GerlichA. M. GieseE. W. Sachs OriginalPaper 07 December 2010 Pages: 1137 - 1161
Non-monotone projection gradient method for non-negative matrix factorization Xiangli LiHongwei LiuXiuyun Zheng OriginalPaper 21 December 2010 Pages: 1163 - 1171
Generating equidistant representations in biobjective programming Stacey L. FaulkenbergMargaret M. Wiecek OriginalPaper 05 April 2011 Pages: 1173 - 1210
A combinatorial optimization algorithm for solving the branchwidth problem J. Cole SmithElif UlusalIllya V. Hicks OriginalPaper 15 February 2011 Pages: 1211 - 1229
Heuristics for a project management problem with incompatibility and assignment costs Nicolas ZuffereyOlivier LabartheDavid Schindl OriginalPaper 02 December 2010 Pages: 1231 - 1252
New dominance rules and exploration strategies for the 1|r i |∑U i scheduling problem Gio K. KaoEdward C. SewellShane N. Hall OriginalPaper 02 December 2010 Pages: 1253 - 1274
A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand Jianlin JiangXiaoming Yuan OriginalPaper 13 January 2011 Pages: 1275 - 1295
A benchmark library and a comparison of heuristic methods for the linear ordering problem Rafael MartíGerhard ReineltAbraham Duarte OriginalPaper 05 January 2011 Pages: 1297 - 1317
Numerical approximation of elliptic control problems with finitely many pointwise constraints Eduardo CasasMariano Mateos OriginalPaper 04 February 2011 Pages: 1319 - 1343
Path-following for optimal control of stationary variational inequalities Karl KunischDaniel Wachsmuth OriginalPaper 10 March 2011 Pages: 1345 - 1373
Capital rationing problems under uncertainty and risk Patrizia BeraldiMaria Elena BruniAntonio Violi OriginalPaper 05 January 2011 Pages: 1375 - 1396
Two complexity results on c-optimality in experimental design Michal ČernýMilan Hladík OriginalPaper 25 November 2010 Pages: 1397 - 1408
