Citation Context

...t of the optimization method will be expressed in terms of function evaluations, which are, in this case, the number of solves of (1). Also, we assume that eigenvalues are 2 j=1computed exactly. See =-=[14]-=- for inexact eigenvalue solves in convex quadratic semi-definite programming. Since we present a subspace method, small scale eigenvalue problems will be solved also. We will employ the QZ method for ...