Large-scale semidefinite programming via a saddle point mirror-prox algorithm (Q868467)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Large-scale semidefinite programming via a saddle point mirror-prox algorithm |
scientific article; zbMATH DE number 5131073
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Large-scale semidefinite programming via a saddle point mirror-prox algorithm |
scientific article; zbMATH DE number 5131073 |
Statements
Large-scale semidefinite programming via a saddle point mirror-prox algorithm (English)
0 references
5 March 2007
0 references
The authors consider semi-definite programs and investigate how to use sparsity patterns of the involved matrices for the solution of such problems by using first-order methods. They present several presentations of these matrices and, based on them, reformulate the original problem into smooth convex-concave saddle point problems. Finally, numerical examples are discussed.
0 references
Semidefinite programming
0 references
saddle point problem
0 references
mirror prox method
0 references
0 references
0 references
