Solving Large-Scale Least Squares Semidefinite Programming by Alternating Direction Methods

The well-known least squares semidefinite programming (LSSDP) problem seeks the nearest adjustment of a given symmetric matrix in the intersection of the cone of positive semidefinite matrices and a set of linear constraints, and it captures many applications in diversing fields. The task of solving...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:SIAM journal on matrix analysis and applications Ročník 32; číslo 1; s. 136 - 152
Hlavní autori: He, Bingsheng, Xu, Minghua, Yuan, Xiaoming
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Philadelphia, PA Society for Industrial and Applied Mathematics 01.01.2011
Predmet:
Algebra
Calculus of variations and optimal control
Exact sciences and technology
Global analysis, analysis on manifolds
Intersections
Least squares method
Linear and multilinear algebra, matrix theory
Linear equations
Mathematical analysis
Mathematical models
Mathematical programming
Mathematics
Matrices
Matrix
Matrix methods
Numerical analysis
Numerical analysis. Scientific computation
Numerical linear algebra
Programming
Sciences and techniques of general use
Semidefinite programming
Studies
Tasks
Topology. Manifolds and cell complexes. Global analysis and analysis on manifolds
Intersection
Alternating direction method
Cone
Solving
Least squares problem
Square matrix
Optimization method
90C06
Semi definite programming
least squares semidefinite matrix
Constrained optimization
Linear constraint
Numerical analysis
Efficiency
Variational inequality
Symmetric matrix
Least squares method
90C25
90C22
Linear algebra
49M29
Large scale
large-scale
ISSN:0895-4798, 1095-7162
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The well-known least squares semidefinite programming (LSSDP) problem seeks the nearest adjustment of a given symmetric matrix in the intersection of the cone of positive semidefinite matrices and a set of linear constraints, and it captures many applications in diversing fields. The task of solving large-scale LSSDP with many linear constraints, however, is numerically challenging. This paper mainly shows the applicability of the classical alternating direction method (ADM) for solving LSSDP and convinces the efficiency of the ADM approach. We compare the ADM approach with some other existing approaches numerically, and we show the superiority of ADM for solving large-scale LSSDP.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
ISSN:0895-4798
1095-7162
DOI:10.1137/090768813