位置：成果数据库 > 期刊 > 期刊详情页
Complexity analysis and numerical implementation of primal-dual interior-point methods for convex qu
  • ISSN号：1017-1398
  • 期刊名称：Numerical Algorithms
  • 时间：2013.2.2
  • 页码：289-306
  • 相关项目：对称锥互补问题的内点算法及在传感器网络定位中的应用研究
作者： Cai X.|Wang G.|Zhang Z.|
同期刊论文项目
对称锥互补问题的内点算法及在传感器网络定位中的应用研究
期刊论文 14 会议论文 1 著作 1
同项目期刊论文
A new polynomial interior-point algorithm for the monotone linear complementarity problem over symme
A class of polynomial interior-point algorithms for the Cartesian $P_*(\kappa)$-second-order cone li
A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone opt
New complexity analysis of interior-point methods for the Cartesian $P_*(\kappa)$-SCLCP
A full-Newton step feasible interior-point algorithm for $P_*(\ kappa)$-linear complementarity probl
Comparison of Multiple Random Walks Strategies for Searching Networks
A Class of Polynomial Interior Point Algorithms for the Cartesian P-Matrix Linear Complementarity Pr
Interior-point methods for Cartesian$P_*(\kappa)$-linear complementarity problems over symmetric con
A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric opti
A new polynomial interior-point algorithm for the Cartesian $P_*(\kappa)$ second-order cone linear c
Research article: On extending primal-dual interior-point method for linear optimization to convex q
Full Nesterov-Todd step feasible interior-point method for the Cartesian $P_*(\kappa)$-SCLCP