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

The LP-Newton method solves the linear programming problem (LP) by repeatedlyprojecting a current point onto a certain relevant polytope. In this paper, weextend the algorithmic framework of the LP-Newton method to the second-ordercone programming problem (SOCP) via a linear semi-infinite programming (LSIP)reformulation of the given SOCP. In the extension, we produce a sequence byprojection onto polyhedral cones constructed from LPs obtained by finitelyrelaxing the LSIP. We show the global convergence property of the proposedalgorithm under mild assumptions, and investigate its efficiency throughnumerical experiments comparing the proposed approach with the primal-dualinterior-point method for the SOCP.

Extension of the LP-Newton method to SOCPs via semi-infinite representation