Abstract
In this paper, we briefly describe two interior-point algorithms for semidefinite programming. At each iteration, both these algorithms compute search directions by solving a linear system. We discuss some preliminary experiments for moderately sized, block diagonal semidefinite programs, comparing direct and iterative methods for solving the linear systems.
| Original language | English (US) |
|---|---|
| Title of host publication | Proceedings of the IEEE International Symposium on Computer-Aided Control System Design |
| Editors | Anon |
| Pages | 235-239 |
| Number of pages | 5 |
| State | Published - 1996 |
| Event | Proceedings of the 1996 IEEE International Symposium on Computer-Aided Control System Design - Dearborn, MI, USA Duration: Sep 15 1996 → Sep 18 1996 |
Other
| Other | Proceedings of the 1996 IEEE International Symposium on Computer-Aided Control System Design |
|---|---|
| City | Dearborn, MI, USA |
| Period | 9/15/96 → 9/18/96 |
ASJC Scopus subject areas
- Computer Science(all)
- Engineering(all)