94
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

A modified infeasible interior-point algorithm with full-Newton step for semidefinite optimization

, &
Pages 1979-1992 | Received 25 Feb 2017, Accepted 23 May 2018, Published online: 15 Nov 2018
 

ABSTRACT

Recently, Mansouri et al. (J. Optim. Theory Appl. 166: 605-618, 2015) presented an improved infeasible interior-point algorithm for linear optimization. Their algorithm has the shortcoming that the proximity measure may be still large when the duality gap approaches to zero. In this paper, we propose an infeasible interior-point algorithm for semidefinite optimization with a modified search direction. This modification is an attempt to decrease the value of the proximity measure, which is important to determine whether or not to perform centreing steps in the classical infeasible interior-point algorithms. Some preliminary numerical results show the benefit of the proposed algorithm as well.

AMS CLASSIFICATIONS:

Disclosure statement

No potential conflict of interest was reported by the authors.

Additional information

Funding

This work was partially supported by National Natural Science Foundation of China (Grant No. 61179040) and Natural Science Basis Research Plan in Shaanxi Province of China (Program No. 2017JM1014).

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.