Skip to content
naulon
Not checkedNot checked for notices yet.

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

Kheirfam Behrouz

Yugoslav Journal of Operations Research · 2018

doi:10.2298/yjor161217017k (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

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.

Abstract licence: CC BY-NC-SA

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.