The Galerkin and least-squares methods are two classes of the most popular Krylovsubspace methOds for solving large linear systems of equations. Unfortunately,
In this paper, a new globally convergent algorithm for nonlinear optimization problems with equality and inequality constraints is presented. The new algorithm
In this paper, we consider the positive semidefinite solution of the matrix equation (AT X A, BT X B) - (C, D). A necessary and sufficient condition for the exi