Numerical Algorithms for Solving Convex Optimization Problems Arising in Systems and Control Theory

The need to optimize occurs frequently in engineering applications. Typically one has a set of constraints specifying what solutions are allowable or meet design specifications and one would like to choose from these allowable solutions one which is optimal with respect to some meaningful metric. Such optimization problems tend to be rather complicated and must be solved numerically. This project is concerned with creating improved numerical algorithms for solving particular important classes of optimization problems that arise in systems and control theory.