Interior proximal methods and central paths for convex second-order cone programming

Shaohua Pan Jein-Shan Chen

Optimization and Control mathscidoc:1910.43920

Nonlinear Analysis: Theory, Methods & Applications, 73, (9), 3083-3100, 2010.11
We make a unified analysis of interior proximal methods of solving convex second-order cone programming problems. These methods use a proximal distance with respect to second-order cones which can be produced with an appropriate closed proper univariate function in three ways. Under some mild conditions, the sequence generated is bounded with each limit point being a solution, and global rates of convergence estimates are obtained in terms of objective values. A class of regularized proximal distances is also constructed which can guarantee the global convergence of the sequence to an optimal solution. These results are illustrated with some examples. In addition, we also study the central paths associated with these distance-like functions, and for the linear SOCP we discuss their relations with the sequence generated by the interior proximal methods. From this, we obtain improved convergence
No keywords uploaded!
[ Download ] [ 2019-10-20 22:48:29 uploaded by Jein_Shan_Chen ] [ 255 downloads ] [ 0 comments ]
@inproceedings{shaohua2010interior,
  title={Interior proximal methods and central paths for convex second-order cone programming},
  author={Shaohua Pan, and Jein-Shan Chen},
  url={http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20191020224829332979449},
  booktitle={Nonlinear Analysis: Theory, Methods & Applications},
  volume={73},
  number={9},
  pages={3083-3100},
  year={2010},
}
Shaohua Pan, and Jein-Shan Chen. Interior proximal methods and central paths for convex second-order cone programming. 2010. Vol. 73. In Nonlinear Analysis: Theory, Methods & Applications. pp.3083-3100. http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20191020224829332979449.
Please log in for comment!
 
 
Contact us: office-iccm@tsinghua.edu.cn | Copyright Reserved