A Corrector–Predictor Path-Following Method for Convex Quadratic Symmetric Cone Optimization
Behrouz Kheirfam ()
Additional contact information
Behrouz Kheirfam: Azarbaijan Shahid Madani University
Journal of Optimization Theory and Applications, 2015, vol. 164, issue 1, No 13, 246-260
Abstract:
Abstract After a brief introduction to Euclidean Jordan algebra, we present a new corrector–predictor path-following interior-point algorithm for convex, quadratic, and symmetric cone optimization. In each iteration, the algorithm involves two kind of steps: a predictor (affine-scaling) step and a full Nesterov and Todd (centring) step. Moreover, we derive the complexity for the algorithm, and we obtain the best-known iteration bound for the small-update method.
Keywords: Convex quadratic symmetric cone optimization; Interior-point method; Corrector–predictor method; Polynomial complexity; 90C22; 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 (1)
Downloads: (external link)
http://link.springer.com/10.1007/s10957-014-0554-2 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:164:y:2015:i:1:d:10.1007_s10957-014-0554-2
Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2
DOI: 10.1007/s10957-014-0554-2
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 ().