Solving large structured semidefinite programs using an inexact spectral bundle method
OPEN ACCESS
Author / Producer
Date
2000
Publication Type
Conference Paper
ETH Bibliography
no
Citations
Altmetric
OPEN ACCESS
Data
Rights / License
Abstract
Semidefinite programs have received a great deal of attention because of the variety of problems that they can model and the rich theory that leads to polynomial-time algorithms to solve them. However, large practical problems are still hard to solve because most algorithms ignore the structure of the problem. In this paper we present an algorithm for solving semidefinite programs that exploits structure yet is not tailored a priori to any particular structure. It adapts a bundle method designed to solve structured LMI feasibility problems. Duality provides a tight lower bound for the optimal cost for use in a termination criterion. A numerical experiment demonstrates that the complexity is comparable to that of structured interior-point methods, and unlike those methods it applies to a general class of structures.
Permanent link
Publication status
published
External links
Editor
Book title
Proceedings of the 39th IEEE Conference on Decision and Control. Volume 5
Journal / series
Volume
Pages / Article No.
5027 - 5032
Publisher
IEEE
Event
39th IEEE Conference on Decision and Control (CDC 2000)
Edition / version
Methods
Software
Geographic location
Date collected
Date created
Subject
Organisational unit
08814 - Smith, Roy (Tit.-Prof.) (ehemalig) / Smith, Roy (Tit.-Prof.) (former)