New complexity analysis of a full Nesterov-Todd step infeasible interior-point algorithm for symmetric optimization

Title:

New complexity analysis of a full Nesterov-Todd step infeasible interior-point algorithm for symmetric optimization

Creator:

Kheirfam, Behrouz and Mahdavi-Amiri, Nezam

Identifier:

https://cdk.lib.cas.cz/client/handle/uuid:e52802fe-282d-4a14-b25f-e5334ae94204
uuid:e52802fe-282d-4a14-b25f-e5334ae94204

Subject:

interior-point methods, symmetric cone optimization, Euclidean Jordan algebra, and polynomial complexity

Type:

model:article and TEXT

Format:

bez média and svazek

Description:

A full Nesterov-Todd step infeasible interior-point algorithm is proposed for solving linear programming problems over symmetric cones by using the Euclidean Jordan algebra. Using a new approach, we also provide a search direction and show that the iteration bound coincides with the best known bound for infeasible interior-point methods.

Language:

English

Rights:

http://creativecommons.org/publicdomain/mark/1.0/
policy:public

Coverage:

[883]-896

Source:

Kybernetika | 2013 Volume:49 | Number:6

Harvested from:

CDK

Metadata only:

false