An alternating direction method for solving convex nonlinear semidefinite programming problems

QR Code

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

Similar Items

A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs
by: Sun, Jie, et al.
Published: (2010)

On methods for solving nonlinear semidefinite optimization problems
by: Sun, Jie
Published: (2011)

The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
by: Sun, D., et al.
Published: (2008)

A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming
by: Qian, X., et al.
Published: (2018)

Properties of the Augmented Lagrangian in Nonlinear Semidefinite Optimization1
by: Sun, Jie, et al.
Published: (2006)

A sequential quadratic penalty method for nonlinear semidefinite programming
by: Huang, X., et al.
Published: (2003)

Lower-order penalization approach to nonlinear semidefinite programming
by: Huang, X., et al.
Published: (2007)

Semismooth homeomorphisms and strong stability of semidefinite and Lorentz complementarity problems
by: Pang, J.S., et al.
Published: (2003)

Bounding Option Prices of Multi-Assets: A Semidefinite Programming Approach
by: Han, D., et al.
Published: (2005)

Convergence analysis of a parallel projection algorithm for solving convex feasibility problems
by: Dang, Y., et al.
Published: (2016)

S-semigoodness for Low-Rank Semidefinite Matrix Recovery
by: Kong, L., et al.
Published: (2014)

A Method of Analytic Centers for Quadratically Constrained Convex Quadratic Programs
by: Mehrotra, S., et al.
Published: (1991)

Positive solutions for three-point semipositone boundary value problems with convex nonlinearity
by: Zhang, Xinguang
Published: (2009)

Successive Convex Approximations to Cardinality-Constrained Convex Programs: A Piecewise-Linear DC Approach
by: Zheng, X., et al.
Published: (2014)

Solving nonlinear two point boundary value problem using two step direct method
by: Phang, Pei See, et al.
Published: (2011)

Analysis of some interior point continuous trajectories for convex programming
by: Qian, X., et al.
Published: (2017)

On the Structure of Convex Piecewise Quadratic Functions
by: Sun, Jie
Published: (1992)

The Convergent Generalized Central Paths for Linearly Constrained Convex Programming
by: Qian, X., et al.
Published: (2018)

An Algorithm for Convex Quadratic Programming That Requires O(n3.5L) Arithmetic Operations
by: Mehrotra, S., et al.
Published: (1990)

Wavelet methods for solving linear and nonlinear singular boundary value problems
by: Nasab, Aliasghar Kazemi
Published: (2014)

Three-step block method for solving nonlinear boundary value problems
by: Phang, Pei See, et al.
Published: (2014)

An inertial triple-projection algorithm for solving the split feasibility problem
by: Dang, Y., et al.
Published: (2023)

Wavelet analysis method for solving linear and nonlinear singular boundary value problems
by: Nasab, A. Kazemi, et al.
Published: (2013)

An efficient pseudospectral method for solving a class of nonlinear optimal control problems
by: Tohidi, Emran, et al.
Published: (2013)

An efficient approach for solving nonlinear troesch's and bratu's problems by wavelet analysis method
by: Nasab, A. Kazemi, et al.
Published: (2013)

Solving third-order boundary value problem by direct methods
by: Ahmad Zulkifli, Ahmad Shah Abdullah
Published: (2014)

An Interior Point Parameterized Central Path Following Algorithm for Linearly Constrained Convex Programming
by: Hou, L., et al.
Published: (2022)

An Application of Differential Search Algorithm in Solving Non-Convex Economic Dispatch Problems with Valve-Point Effects
by: M. H., Sulaiman
Published: (2013)

Minimum recession-compatible subsets of closed convex sets
by: He, Y., et al.
Published: (2012)

Alternating direction method of multipliers for nonconvex fused regression problems
by: Xiu, X., et al.
Published: (2019)

TRIZ: an alternate way to solve problem for student
by: Tee, Tze Kiong, et al.
Published: (2017)

A new inexact line search method for convex optimization problems
by: Moyi, Aliyu Usman, et al.
Published: (2013)

Homotopy-perturbation method for direct solution of nonlinear initial value problem
by: Chowdhury, Md. Sazzad Hossien, et al.
Published: (2007)

Solving directly two point boundary value problems using direct multistep method
by: Mahanum Diana Jafri,, et al.
Published: (2009)

Solving directly two point boundary value problems using direct multistep method.
by: Jafri, Mahanum Diana, et al.
Published: (2009)

A model of distributionally robust two-stage stochastic convex programming with linear recourse
by: Li, Bin, et al.
Published: (2018)

Double projection algorithms for solving the split feasibility problems
by: Dang, Y.Z., et al.
Published: (2019)

Solving nonlinear system of third-order boundary value problems using block method
by: Phang, Pei See, et al.
Published: (2014)

The Non-convex Sparse Problem with Nonnegative Constraint for Signal Reconstruction
by: Wang, Y., et al.
Published: (2016)

Solving boundary value problems with Neumann conditions using direct method
by: Phang, Pei See, et al.
Published: (2013)