Title | Reformulation: Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods [electronic resource] / edited by Masao Fukushima, Liqun Qi |
---|---|

Imprint | Boston, MA : Springer US : Imprint: Springer, 1999 |

Connect to | http://dx.doi.org/10.1007/978-1-4757-6388-1 |

Descript | VIII, 444 p. online resource |

SUMMARY

The concept of "reformulation" has long been playing an important role in mathematical programming. A classical example is the penalization technique in constrained optimization that transforms the constraints into the objective function via a penalty function thereby reformulating a constrained problem as an equivalent or approximately equivalent unconstrained problem. More recent trends consist of the reformulation of various mathematical programming probยญ lems, including variational inequalities and complementarity problems, into equivalent systems of possibly nonsmooth, piecewise smooth or semismooth nonlinear equations, or equivalent unconstrained optimization problems that are usually differentiable, but in general not twice differentiable. Because of the recent advent of various tools in nonsmooth analysis, the reformulation approach has become increasingly profound and diversified. In view of growing interests in this active field, we planned to organize a cluster of sessions entitled "Reformulation - Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods" in the 16th International Symposium on Mathematical Programming (ismp97) held at Lausanne EPFL, Switzerland on August 24-29, 1997. Responding to our invitation, thirty-eight people agreed to give a talk within the cluster, which enabled us to organize thirteen sessions in total. We think that it was one of the largest and most exciting clusters in the symposium. Thanks to the earnest support by the speakers and the chairpersons, the sessions attracted much attention of the participants and were filled with great enthusiasm of the audience

CONTENT

Solving Complementarity Problems by Means of a New Smooth Constrained Nonlinear Solver -- ?-Enlargements of Maximal Monotone Operators: Theory and Applications -- A Non-Interior Predictor-Corrector Path-Following Method for LCP -- Smoothing Newton Methods for Nonsmooth Dirichlet Problems -- Frictional Contact Algorithms Based on Semismooth Newton Methods -- Well-Posed Problems and Error Bounds in Optimization -- Modeling and Solution Environments for MPEC: GAMS & MATLAB -- Merit Functions and Stability for Complementarity Problems -- Minimax and Triality Theory in Nonsmooth Variational Problems -- Global and Local Superlinear Convergence Analysis of Newton-Type Methods for Semismooth Equations with Smooth Least Squares -- Inexact Trust-Region Methods for Nonlinear Complementarity Problems -- Regularized Newton Methods for Minimization of Convex Quadratic Splines with Singular Hessians -- Regularized Linear Programs with Equilibrium Constraints -- Reformulations of a Bicriterion Equilibrium Model -- A Smoothing Function and its Applications -- On the Local Superโ{128}{148}Linear Convergence of a Matrix Secant Implementation of the Variable Metric Proximal Point Algorithm for Monotone Operators -- Reformulation of a Problem of Economic Equilibrium -- A Globally Convergent Inexact Newton Method for Systems of Monotone Equations -- On the Limiting Behavior of the Trajectory of Regularized Solutions of a P0-Complementarity Problem -- Analysis of a Non-Interior Continuation Method Based on Chen-Mangasarian Smoothing Functions for Complementarity Problems -- A New Merit Function and a Descent Method for Semidefinite Complementar ity Problems -- Numerical Experiments for a Class of Squared Smoothing Newton Methods for Box Constrained Variational Inequality Problems

Mathematics
Special functions
Mathematical models
Mathematical optimization
Calculus of variations
Mathematics
Optimization
Mathematics general
Mathematical Modeling and Industrial Mathematics
Calculus of Variations and Optimal Control; Optimization
Special Functions