Solving semidefinite programming problems via alternating direction methods (Q2493944)
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: Solving semidefinite programming problems via alternating direction methods |
scientific article; zbMATH DE number 5033460
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving semidefinite programming problems via alternating direction methods |
scientific article; zbMATH DE number 5033460 |
Statements
Solving semidefinite programming problems via alternating direction methods (English)
0 references
16 June 2006
0 references
The author proposes an alternating direction method to solve the semi definite programming problem. In this respect the complementary conditions in the primal-dual optimality conditions are reformulated as a projection equation and based on this reformulation at each iterate is needed only to solve a linear system with reduced dimension and make one projection. It is proved that the algorithm converges to a solution of the semidefinite programming problem under weak conditions.
0 references
semidefinite programming
0 references
convergence
0 references
projection equation
0 references
alternating direction method
0 references
primal-dual optimality conditions
0 references
algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8934001326560974
0 references
0.8909350037574768
0 references
0.8501717448234558
0 references
0.8497903347015381
0 references
