Find in Library

A sequential quadratic programming method with line search is analyzed and studied for finding the local solution of a nonlinear semidefinite programming problem resulting from the discrete-time output feedback problem. The method requires an initial feasible point with respect to two positive definite constraints. By parameterizing the optimization problem we ease that requirement. The method is tested numerically on several test problems chosen from the benchmark collection (Leibfritz, 2004).