Computational nonsmooth optimization Liqun QiAndrzej RuszczyńskiRobert Womersley Preface Pages: 351 - 352
Constraint aggregation principle in convex optimization Yuri M. ErmolievArkadii V. KryazhimskiiAndrzej Ruszczyński OriginalPaper Pages: 353 - 372
Separating plane algorithms for convex optimization Evgeni A. Nurminski OriginalPaper Pages: 373 - 391
Variable metric bundle methods: From conceptual to implementable forms Claude LemaréchalClaudia Sagastizábal OriginalPaper Pages: 393 - 410
A preconditioning proximal newton method for nondifferentiable convex optimization Liqun QiXiaojun Chen OriginalPaper Pages: 411 - 429
A trust region method for minimization of nonsmooth functions with linear constraints José Mario MartínezAntonio Carlos Moretti OriginalPaper Pages: 431 - 449
Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems Nobuo YamashitaMasao Fukushima OriginalPaper Pages: 469 - 491
A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems Francisco FacchineiChristian Kanzow OriginalPaper Pages: 493 - 512
Solution of monotone complementarity problems with locally Lipschitzian functions Andreas Fischer OriginalPaper Pages: 513 - 532
QPCOMP: A quadratic programming based solver for mixed complementarity problems Stephen C. BillupsMichael C. Ferris OriginalPaper Pages: 533 - 562
Implementation of a continuation method for normal maps Hichem SellamiStephen M. Robinson OriginalPaper Pages: 563 - 578
Parametrizations of Kojima’s system and relations to penalty and barrier functions Bernd Kummer OriginalPaper Pages: 579 - 592
Sensitivity analysis of composite piecewise smooth equations Daniel RalphStefan Scholtes OriginalPaper Pages: 593 - 612
