A new full-NT step interior-point method for circular cone optimization
Abstract
We present a full step interior-point algorithm for circular cone
optimization using Euclidean Jordan algebras. The specificity of our
method is to use a transformation similar to that introduced by
Darvay and Tak\'acs for the centering equations of the central path.
The Nesterov and Todd symmetrization scheme is used to derive from
the search directions. We derive the iteration bound that match the
currently best-known iteration bound for small-update methods.
Downloads
Published
Issue
Section
License
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
