Abstract
We reduce the size of large semidefinite programming problems by identifying necessary linear matrix inequalities (LMI's) using Monte Carlo techniques. We describe three algorithms for detecting necessary LMI constraints that extend algorithms used in linear programming to semidefinite programming. We demonstrate that they are beneficial and could serve as tools for a semidefinite programming preprocessor.
Original language | English (US) |
---|---|
Pages (from-to) | 139-153 |
Number of pages | 15 |
Journal | International Journal of Nonlinear Sciences and Numerical Simulation |
Volume | 2 |
Issue number | 2 |
DOIs | |
State | Published - 2001 |
ASJC Scopus subject areas
- Statistical and Nonlinear Physics
- Computational Mechanics
- Modeling and Simulation
- Engineering (miscellaneous)
- Mechanics of Materials
- General Physics and Astronomy
- Applied Mathematics