1. ScholarBank@NUS
  2. 1. Staff
  3. Staff Publications
Please use this identifier to cite or link to this item: https://doi.org/10.1080/02331934.2011.611883
DC FieldValue
dc.titleAn alternating direction method for solving convex nonlinear semidefinite programming problems
dc.contributor.authorZhang, S.
dc.contributor.authorAng, J.
dc.contributor.authorSun, J.
dc.date.accessioned2014-12-12T07:47:09Z
dc.date.available2014-12-12T07:47:09Z
dc.date.issued2013-04
dc.identifier.citationZhang, S., Ang, J., Sun, J. (2013-04). An alternating direction method for solving convex nonlinear semidefinite programming problems. Optimization 62 (4) : 527-543. ScholarBank@NUS Repository. https://doi.org/10.1080/02331934.2011.611883
dc.identifier.issn02331934
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/116218
dc.description.abstractAn 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. © 2013 Copyright Taylor and Francis Group, LLC.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1080/02331934.2011.611883
dc.sourceScopus
dc.subjectalternating direction method
dc.subjectconvex semidefinite programming
dc.subjectmatrix completion
dc.subjectvariational inequalities
dc.typeArticle
dc.contributor.departmentDECISION SCIENCES
dc.description.doi10.1080/02331934.2011.611883
dc.description.sourcetitleOptimization
dc.description.volume62
dc.description.issue4
dc.description.page527-543
dc.identifier.isiut000318152100008
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.