A full-step interior-point algorithm for second-order cone optimization based on a simple locally kernel function

2013 ◽  
Vol 28 (3) ◽  
pp. 619-639
Author(s):  
Lipu Zhang ◽  
Yanqin Bai ◽  
Yinghong Xu
Keyword(s):  
Kernel Function ◽  
Interior Point ◽  
Second Order ◽  
Interior Point Algorithm ◽  
Second Order Cone

scholarly journals New complexity analysis of full Nesterov-Todd step infeasible interior point method for second-order cone optimization

2018 ◽  
Vol 28 (1) ◽  
pp. 21-38
Author(s):  
Behrouz Kheirfam
Keyword(s):  
Interior Point ◽  
Interior Point Method ◽  
Interior Point Methods ◽  
Complexity Analysis ◽  
Second Order ◽  
Interior Point Algorithm ◽  
Complexity Bound ◽  
Second Order Cone ◽  
Infeasible Interior Point Method ◽  
Barrier Parameter

We present a full Nesterov-Todd (NT) step infeasible interior-point algorithm for second-order cone optimization based on a different way to calculate feasibility direction. In each iteration of the algorithm we use the largest possible barrier parameter value ?. Moreover, each main iteration of the algorithm consists of a feasibility step and a few centering steps. The feasibility step differs from the feasibility step of the other existing methods. We derive the complexity bound which coincides with the best known bound for infeasible interior point methods.

Sign in / Sign up

Export Citation Format

Share Document