A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
We consider a Newton-CG augmented Lagrangian method for solving semidefinite programming (SDP) problems from the perspective of approximate semismooth Newton methods. In order to analyze the rate of convergence of our proposed method, we characterize the Lipschitz continuity of the corresponding sol...
Main Authors: | Toh, Kim Chuan, Zhao, Xin-Yuan, Sun, Defeng |
---|---|
Other Authors: | Singapore-MIT Alliance in Research and Technology (SMART) |
Format: | Article |
Language: | en_US |
Published: |
Society for Industrial and Applied Mathematics
2010
|
Online Access: | http://hdl.handle.net/1721.1/58308 |
Similar Items
-
Nonsmooth Newton’s Method and Semidefinite Optimization
by: Sun, Jie
Published: (2003) -
Augmented Lagrangian and differentiable exact penalty methods
Published: (2002) -
A study on augmented Lagrangian-based splitting methods for separable convex programming
by: Wang, Kai
Published: (2017) -
Augmented Lagrangian method for generalized TV-stokes model
by: Tai, Xue Cheng, et al.
Published: (2013) -
On the Burer–Monteiro method for general semidefinite programs
by: Cifuentes, Diego
Published: (2021)