English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In this paper, we give a unified analysis for both large- and small-update interior-point methods for the Cartesian P*(κ)-linear complementarity problem over symmetric cones based on a finite barrier. The proposed finite barrier is used both for determining the search directions and for measuring the distance between the given iterate and the μ-center for the algorithm. The symmetry of the resulting search directions is forced by using the Nesterov-Todd scaling scheme. By means of Euclidean Jordan algebras, together with the feature of the finite kernel function, we derive the iteration bounds that match the currently best known iteration bounds for large- and small-update methods. Furthermore, our algorithm and its polynomial iteration complexity analysis provide a unified treatment for a class of primal-dual interior-point methods and their complexity analysis. © 2013 Wang et al.

New complexity analysis of interior-point methods for the Cartesian P ∗ ( κ ) -SCLCP