Please use this identifier to cite or link to this item: https://doi.org/10.1080/02331934.2011.611883
Title: An alternating direction method for solving convex nonlinear semidefinite programming problems
Authors: Zhang, S.
Ang, J. 
Sun, J. 
Keywords: alternating direction method
convex semidefinite programming
matrix completion
variational inequalities
Issue Date: Apr-2013
Citation: Zhang, 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
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. © 2013 Copyright Taylor and Francis Group, LLC.
Source Title: Optimization
URI: http://scholarbank.nus.edu.sg/handle/10635/116218
ISSN: 02331934
DOI: 10.1080/02331934.2011.611883
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

5
checked on Oct 15, 2018

WEB OF SCIENCETM
Citations

5
checked on Dec 20, 2017

Page view(s)

58
checked on Oct 19, 2018

Google ScholarTM

Check

Altmetric


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