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

A problem of minimization of L₁-penalized conditional value-at-risk (CVaR) is considered. It is shown that there exists a non-negative threshold value of the penalty parameter such that the optimal value of the penalized problem is unbounded if the penalty parameter is less than the threshold value, and it is bounded if the penalty parameter is greater or equal than this value. It is established that the threshold value can be found via the solution of a linear programming problem, and, therefore, readily computable. Theoretical results are illustrated by numerical examples.14 page(s

Threshold value of the penalty parameter in the minimization of $L_1$-penalized conditional value-at-risk