The identification of discontinuous parameters in elliptic systems is formulated as a constrained minimization problem combining the output least squares and the equation error method. The minimization problem is then proved to be equivalent to the saddle-point problem of an augmented Lagrangian. The finite element method is used to discretize the saddle-point problem, and the convergence of th...

Recently, the problem of local minima in very high dimensional non-convex optimization has been challenged and the problem of saddle points has been introduced. This paper introduces a dynamic type of normalization that forces the system to escape saddle points. Unlike other saddle point escaping algorithms, second order information is not utilized, and the system can be trained with an arbitra...

In this note, we discuss the convergence behavior of a modified inexact Uzawa algorithm for solving generalized saddle point problems, which is an extension of the result obtained in a recent paper [Z.H. Cao, Fast Uzawa algorithm for generalized saddle point problems, Appl. Numer. Math., 46 (2003) 157-171]. Keywords—Saddle point problem; Inexact Uzawa algorithm; Convergence behavior.

in this paper we consider the solutions of linear systems of saddle point problems‎. ‎by using the spectrum of a quadratic matrix polynomial‎, ‎we study the eigenvalues of the iterative matrix of the hermitian and skew hermitian splitting method‎.