Preface. Some Perspectives on High-Performance Mathematical Software; D. di Serafino, et al. A Monotonous Method for Unconstrained Lipschitz Optimization; A.M. Bagirov, N.K. Gadijev. Numerical Performance of an Inexact Interior Point Algorithm; S. Bellavia. Replicator Dynamics for Evolution towards the Maximum Clique: Variations and Experiments; I.M. Bomze, F. Rendl. A Newton-Like Approach to Solving an Equilibrium Problem; V.A. Bulavski, V.V. Kalashnikov. Parallelization Strategies for the Ant System; B. Bullnheimer, et al. The Cobweb Method for Minimizing Convex Functions; V. Capalbo, et al. A New Forward Backward Auction Algorithm; R. Cerulli, et al. Modifying the Cholesky Factorization on MIMD Distributed Memory Machines; M. D'Apuzzo, et al. A Controlled Random Search Algorithm with Local Newton-type Search for Global Optimization; G. Di Pillo, et al. Adaptive Precision Control in Quadratic Programming with Simple Bounds and/or Equalities; Z. Dostal, et al. The Development of Parallel Optimisation Routines for the NAG Parallel Library; R.W. Ford, et al. Parallel Solution of Large Scale Quadratic Programs; E. Galligani, et al. A Linesearch Algorithm with Memory for Unconstrained Optimization; N.I.M. Gould, et al. The Modified Absolute-Value Factorization Norm for Trust-Region Minimization; N.I.M. Gould, J. Nocedal. The LP Dual Active Set Algorithm; W.W. Hager. The Use of Optimization Techniques for the Numerical Solution of First Kind Fredholm Equations; P. Maponi, et al. An Exact Parallel Algorithm for the Maximum Clique Problem; P.M. Pardalos, et al. A Model Development System for Global Optimization; J.D. Pinter. Support Vector Machines: A Large Scale QP; M. Pontil, et al. Orbit Determination of Binary Stars Using SimulatedAnnealing; D. Pourbaix. New Derivative Formulas for Integral and Probability Functions: Parallel Computations; S. Uryasev. The Interior-Point Revolution in Constrained Optimization; M.H. Wright.