This book provides a comprehensive treatment of a very successful class of methods for
solving optimization problems with PDE and inequality constraints as well as variational …

Smoothing methods, extensively used for solving important mathematical programming
problems and applications, are applied here to generate and solve an unconstrained …

We consider a class of smoothing methods for minimization problems where the feasible set
is convex but the objective function is not convex, not differentiable and perhaps not even …

Smoothing functions have been much studied in the solution of optimization and
complementarity problems with nonnegativity constraints. In this paper, we extend …

In this paper, we investigate the solution of bang‐bang optimal control problems by shooting
methods. We will show how modifying the performance index by a term depending on a …

In this paper we take a new look at smoothing Newton methods for solving the nonlinear
complementarity problem (NCP) and the box constrained variational inequalities (BVI) …

We consider superlinearly convergent analogues of Newton methods for nondifferentiable
operator equations in function spaces. The superlinear convergence analysis of semismooth …

The second-order cone complementarity problem (SOCCP) is a wide class of problems
containing the nonlinear complementarity problem (NCP) and the second-order cone …

In this paper, we consider a class of n-person noncooperative games, where the utility
function of every player is given by a homogeneous polynomial defined by the payoff tensor …

This book introduces advanced numerical-functional analysis to beginning computer
science researchers. The reader is assumed to have had basic courses in numerical …