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 aim of this paper is to implement some new techniques, based on conjugateduality in convex optimization, for proving the existence of global errorbounds for convex inequality systems. We deal first of all with systemsdescribed via one convex inequality and extend the achieved results, by makinguse of a celebrated scalarization function, to convex inequality systemsexpressed by means of a general vector function. We also propose a secondapproach for guaranteeing the existence of global error bounds of the latter,which meanwhile sharpens the classical result of Robinson.

Error bound results for convex inequality systems via conjugate duality