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 Tools annual

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

In this paper, we develop an enhanced version of the catching-up algorithmfor sweeping processes through an appropriate concept of approximateprojections. We establish some properties of this notion of approximateprojection. Then, under suitable assumptions, we show the convergence of theenhanced catching-up algorithm for prox-regular, subsmooth, and merely closedsets. Finally, we discuss efficient numerical methods for obtaining approximateprojections. Our results recover classical existence results in the literatureand provide new insight into the numerical simulation of sweeping processes.

Catching-up Algorithm with Approximate Projections for Moreau's Sweeping Processes