An alternating direction method for solving convex nonlinear semidefinite programming problems
| dc.contributor.author | Zhang, S. | |
| dc.contributor.author | Ang, J. | |
| dc.contributor.author | Sun, Jie | |
| dc.date.accessioned | 2017-01-30T15:18:43Z | |
| dc.date.available | 2017-01-30T15:18:43Z | |
| dc.date.created | 2014-09-02T20:01:17Z | |
| dc.date.issued | 2013 | |
| dc.identifier.citation | Zhang, S. and Ang, J. and Sun, J. 2013. An alternating direction method for solving convex nonlinear semidefinite programming problems. Optimization. 62 (4): pp. 527-543. | |
| dc.identifier.uri | http://hdl.handle.net/20.500.11937/45136 | |
| dc.identifier.doi | 10.1080/02331934.2011.611883 | |
| dc.description.abstract |
An alternating direction method is proposed for solving convex semidefinite optimization problems. This method only computes several metric projections at each iteration. Convergence analysis is presented and numerical experiments in solving matrix completion problems are reported. | |
| dc.publisher | Taylor & Francis Ltd. | |
| dc.title | An alternating direction method for solving convex nonlinear semidefinite programming problems | |
| dc.type | Journal Article | |
| dcterms.source.volume | 62 | |
| dcterms.source.startPage | 527 | |
| dcterms.source.endPage | 543 | |
| dcterms.source.issn | 0233-1934 | |
| dcterms.source.title | Optimization | |
| curtin.note |
This is an Author's Accepted Manuscript of an article published in Optimization (2013), copyright Taylor & Francis, available online at: <a href="http://www.tandfonline.com/10.1080/02331934.2011.611883">http://www.tandfonline.com/10.1080/02331934.2011.611883</a>. | |
| curtin.accessStatus | Open access |