A New Strategy in the Complexity Analysis of an Infeasible-Interior-Point Method for Symmetric Cone Programming

Ximei Yang (), Hongwei Liu () and Yinkui Zhang
Additional contact information
Ximei Yang: Xidian University
Hongwei Liu: Xidian University
Yinkui Zhang: Henan Normal University

Journal of Optimization Theory and Applications, 2015, vol. 166, issue 2, No 11, 572-587

Abstract: Abstract In this paper, we give a new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming. Using the strategy, we improve the theoretical complexity bound of an infeasible-interior-point method. Convergence is shown for a commutative class of search directions, which includes the Nesterov–Todd direction and the $$xs$$ x s and $$sx$$ s x directions.

Keywords: Jordan algebra; Symmetric cone programming; Infeasible-interior-point method; Polynomial complexity; 90C05; 90C51 (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s10957-014-0670-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:166:y:2015:i:2:d:10.1007_s10957-014-0670-z

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-014-0670-z

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().