Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
Euclidean Jordan algebras were proved more than a decade ago to be an indispensable tool in the unified study of interior-point methods. By using it, we generalize the full-Newton step infeasible interior-point method for linear optimization of Roos [Roos, C., 2006. A full-Newton step O(n) infeasible interior-point algorithm for linear optimization. SIAM Journal on Optimization. 16 (4), 1110-1136 (electronic)] to symmetric optimization. This unifies the analysis for linear, second-order cone and semidefinite optimizations.
Year of publication: |
2011
|
---|---|
Authors: | Gu, G. ; Zangiabadi, M. ; Roos, C. |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 214.2011, 3, p. 473-484
|
Publisher: |
Elsevier |
Keywords: | Interior point methods Conic programming Nesterov-Todd step |
Saved in:
Saved in favorites
Similar items by person