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

Optimization problems under affine constraints appear in various areas ofmachine learning. We consider the task of minimizing a smooth strongly convexfunction F(x) under the affine constraint Kx=b, with an oracle providingevaluations of the gradient of F and multiplications by K and its transpose. Weprovide lower bounds on the number of gradient computations and matrixmultiplications to achieve a given accuracy. Then we propose an acceleratedprimal-dual algorithm achieving these lower bounds. Our algorithm is the firstoptimal algorithm for this class of problems.

An Optimal Algorithm for Strongly Convex Minimization under Affine Constraints