2016
DOI: 10.1016/j.neucom.2016.06.043
|View full text |Cite
|
Sign up to set email alerts
|

Modified alternating direction method of multipliers for convex quadratic semidefinite programming

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
13
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 12 publications
(13 citation statements)
references
References 29 publications
0
13
0
Order By: Relevance
“…[3] for a concrete example). Therefore, attentions have been paid to the design of multi-block ADMM-type algorithms and, fortunately, several algorithms of this type have been successfully applied to solving the CQSDP problem via its dual with a satisfactory numerical efficiency and a theoretical guarantee of convergence [1,4,14].…”
Section: Introductionmentioning
confidence: 99%
See 4 more Smart Citations
“…[3] for a concrete example). Therefore, attentions have been paid to the design of multi-block ADMM-type algorithms and, fortunately, several algorithms of this type have been successfully applied to solving the CQSDP problem via its dual with a satisfactory numerical efficiency and a theoretical guarantee of convergence [1,4,14].…”
Section: Introductionmentioning
confidence: 99%
“…Among of these ADMM-type algorithms for CQSDP problems, the modified 3-block ADMM by Chang et al [1] has a distinct feature that one of the subproblems, i.e., the minimization of the augmented Lagrangian function with respect to a certain block of variables, can always be skipped. This saves both the computational cost and the memory for variable storage, and, more importantly, the convergence is guaranteed under only one extra condition on the penalty parameter σ, while the proof for the convergence is much more involved.…”
Section: Introductionmentioning
confidence: 99%
See 3 more Smart Citations