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 class of nonseparable mathematical programs in which the vector variable can be partitioned into a number of subvectors corresponding to independent constraint sets, as opposed to two such subvectors considered in an earlier paper by Wendell and Hurter (W-H). Several optimality conditions previously given by W-H are extended to this more general case.

Technical Note—Further Results on the Minimization of a Nonseparable Objective Function Subject to Disjoint Constraints