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

We consider the problem of projecting a point onto a regiondefined by a linear equality or inequality constraint andtwo-sided bounds on the variables. Such problems are interestingbecause they arise in various practical problems and assubproblems of gradient-type methods for constrained optimization.Polynomial algorithms are proposed for solving these problems andtheir convergence is proved. Some examples and results ofnumerical experiments are presented

Polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints inℝn