Journal
OPTIMIZATION
Volume 67, Issue 6, Pages 889-905Publisher
TAYLOR & FRANCIS LTD
DOI: 10.1080/02331934.2018.1432610
Keywords
Symmetric optimization; interior-point methods; polynomial complexity
Funding
- Ministry of Research and Innovation CNCS - UEFISCDI, within PNCDI III [PN-III-P4-ID-PCE-2016-0190]
Ask authors/readers for more resources
We introduce an interior-point method for symmetric optimization based on a new method for determining search directions. In order to accomplish this, we use a new equivalent algebraic transformation on the centring equation of the system which characterizes the central path. In this way, we obtain a new class of directions. We analyse a special case of this class, which leads to the new interior-point algorithm mentioned before. Another way to find the search directions is using barriers derived from kernel functions. We show that in our case the corresponding direction cannot be deduced from a usual kernel function. In spite of this fact, we prove the polynomial complexity of the proposed algorithm.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available