Recent advances in nonsmooth optimization

In the past few decades, there has been a large amount of work on algorithms for linear network flow problems, special classes of network problems such as assignment problems (linear and quadratic), Steiner tree problem, topology network design and nonconvex cost network flow problems.Network optimization problems find numerous applications in transportation, in communication network design, in production and inventory planning, in facilities location and allocation, and in Vlsi design.The purpose of this book is to cover a spectrum of recent developments in network optimization problems, from linear networks to general nonconvex network flow problems Hybrid Methods for Finding the Nearest Euclidean Distance Matrix / S. Al-Homidan and R. Fletcher -- Subdifferential Characterization of Convexity / R. Correa, A. Jofre and L. Thibault -- A Simple Triangulation of R[superscript n] with Fewer Simplices for Solving Nonsmooth Convex Programming / C.-Y. Dang -- On Generalized Differentiability of Optimal Solutions and its Application to an Algorithm for Solving Bilevel Optimization Problems / S. Dempe -- Projected Gradient Methods for Nonlinear Complementarity Problems via Normal Maps / M. C. Ferris and D. Ralph -- An NCP-Function and its Use for the Solution of Complementarity Problems / A. Fischer -- An Elementary Rate of Convergence Proof for the Deep Cut Ellipsoid Algorithm / J. B. G. Frenk and J. Gromicho -- Solving Nonsmooth Equations by Means of Quasi-Newton Methods with Globalization / M. A. C. Ruggiero, J. M. Martinez and S. A. Santos