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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

This paper presents rigorous forward error bounds for linear conicoptimization problems. The error bounds are formulated in a quite generalframework; the underlying vector spaces are not required to befinite-dimensional, and the convex cones defining the partial ordering are notrequired to be polyhedral. In the case of linear programming, second order coneprogramming, and semidefinite programming specialized formulas are deducedyielding guaranteed accuracy. All computed bounds are completely rigorousbecause all rounding errors due to floating point arithmetic are taken intoaccount. Numerical results, applications and software for linear andsemidefinite programming problems are described.

Guaranteed Accuracy for Conic Programming Problems in Vector Lattices