Inexact Catching-Up Algorithm for Moreau's Sweeping Processes
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866909452173574144 |
|---|---|
| author | Garrido, Juan Guillermo Lioi, Maximiliano Vilches, Emilio |
| author_facet | Garrido, Juan Guillermo Lioi, Maximiliano Vilches, Emilio |
| contents | In this paper, we develop an inexact version of the catching-up algorithm for sweeping processes. We define a new notion of approximate projection, which is compatible with any numerical method for approximating exact projections, as this new notion is not restricted to remain strictly within the set. We provide several properties of the new approximate projections, which enable us to prove the convergence of the inexact catching-up algorithm in three general frameworks: prox-regular moving sets, subsmooth moving sets, and merely closed sets. Additionally, we apply our numerical results to address complementarity dynamical systems, particularly electrical circuits with ideal diodes. In this context, we implement the inexact catching-up algorithm using a primal-dual optimization method, which typically does not necessarily guarantee a feasible point. Our results are illustrated through an electrical circuit with ideal diodes. Our results recover classical existence results in the literature and provide new insights into the numerical simulation of sweeping processes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_04781 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Inexact Catching-Up Algorithm for Moreau's Sweeping Processes Garrido, Juan Guillermo Lioi, Maximiliano Vilches, Emilio Optimization and Control Numerical Analysis 34G25, 34A60, 49J53, 65L20 In this paper, we develop an inexact version of the catching-up algorithm for sweeping processes. We define a new notion of approximate projection, which is compatible with any numerical method for approximating exact projections, as this new notion is not restricted to remain strictly within the set. We provide several properties of the new approximate projections, which enable us to prove the convergence of the inexact catching-up algorithm in three general frameworks: prox-regular moving sets, subsmooth moving sets, and merely closed sets. Additionally, we apply our numerical results to address complementarity dynamical systems, particularly electrical circuits with ideal diodes. In this context, we implement the inexact catching-up algorithm using a primal-dual optimization method, which typically does not necessarily guarantee a feasible point. Our results are illustrated through an electrical circuit with ideal diodes. Our results recover classical existence results in the literature and provide new insights into the numerical simulation of sweeping processes. |
| title | Inexact Catching-Up Algorithm for Moreau's Sweeping Processes |
| topic | Optimization and Control Numerical Analysis 34G25, 34A60, 49J53, 65L20 |
| url | https://arxiv.org/abs/2501.04781 |