An alternating direction method for solving convex nonlinear semidefinite programming problems

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.

Bibliographic Details
Main Authors: Zhang, S., Ang, J., Sun, Jie
Format: Journal Article
Published: Taylor & Francis Ltd. 2013
Online Access:http://hdl.handle.net/20.500.11937/45136
_version_ 1848757199140028416
author Zhang, S.
Ang, J.
Sun, Jie
author_facet Zhang, S.
Ang, J.
Sun, Jie
author_sort Zhang, S.
building Curtin Institutional Repository
collection Online Access
description 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.
first_indexed 2025-11-14T09:24:18Z
format Journal Article
id curtin-20.500.11937-45136
institution Curtin University Malaysia
institution_category Local University
last_indexed 2025-11-14T09:24:18Z
publishDate 2013
publisher Taylor & Francis Ltd.
recordtype eprints
repository_type Digital Repository
spelling curtin-20.500.11937-451362017-09-13T15:57:40Z An alternating direction method for solving convex nonlinear semidefinite programming problems Zhang, S. Ang, J. Sun, Jie 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 Journal Article http://hdl.handle.net/20.500.11937/45136 10.1080/02331934.2011.611883 Taylor & Francis Ltd. fulltext
spellingShingle Zhang, S.
Ang, J.
Sun, Jie
An alternating direction method for solving convex nonlinear semidefinite programming problems
title An alternating direction method for solving convex nonlinear semidefinite programming problems
title_full An alternating direction method for solving convex nonlinear semidefinite programming problems
title_fullStr An alternating direction method for solving convex nonlinear semidefinite programming problems
title_full_unstemmed An alternating direction method for solving convex nonlinear semidefinite programming problems
title_short An alternating direction method for solving convex nonlinear semidefinite programming problems
title_sort alternating direction method for solving convex nonlinear semidefinite programming problems
url http://hdl.handle.net/20.500.11937/45136