Exploiting structured sparsity in large scale semidefinite programming problems

1Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Semidefinite programming (SDP) covers a wide range of applications such as robust optimization, polynomial optimization, combinatorial optimization, system and control theory, financial engineering, machine learning, quantum information and quantum chemistry. In those applications, SDP problems can be large scale easily. Such large scale SDP problems often satisfy a certain sparsity characterized by a chordal graph structure. This sparsity is classified in two types. The one is the domain space sparsity (d-space sparsity) for positive semidefinite symmetric matrix variables involved in SDP problems, and the other the range space sparsity (r-space sparsity) for matrix-inequality constraints in SDP problems. In this short note, we survey how we exploit these two types of sparsities to solve large scale linear and nonlinear SDP problems. We refer to the paper [7] for more details. © 2010 Springer-Verlag.

References Powered by Scopus

Global optimization with polynomials and the problem of moments

1860Citations
N/AReaders
Get full text

Semidefinite programming for ad hoc wireless sensor network localization

478Citations
N/AReaders
Get full text

Positive definite completions of partial Hermitian matrices

386Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Under-approximating reach sets for polynomial continuous systems

17Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Kojima, M. (2010). Exploiting structured sparsity in large scale semidefinite programming problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6327 LNCS, pp. 4–9). https://doi.org/10.1007/978-3-642-15582-6_2

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 4

80%

Researcher 1

20%

Readers' Discipline

Tooltip

Mathematics 3

43%

Computer Science 2

29%

Engineering 2

29%

Save time finding and organizing research with Mendeley

Sign up for free