A smoothing Newton method for a type of
✍
Xiantao Xiao; Liwei Zhang; Jianzhong Zhang
📂
Article
📅
2009
🏛
Elsevier Science
🌐
English
⚖ 629 KB
We consider an inverse problem arising from the semi-definite quadratic programming (SDQP) problem. We represent this problem as a cone-constrained minimization problem and its dual (denoted ISDQD) is a semismoothly differentiable (SC 1 ) convex programming problem with fewer variables than the orig