Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2504.17864 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912346314637312 |
|---|---|
| author | Pinta, Titus |
| author_facet | Pinta, Titus |
| contents | We study a variant of Newton's algorithm applied to under-determined systems of non-smooth equations. The notion of regularity employed in our work is based on Newton differentiability, which generalizes semi-smoothness. The classic notion of Newton differentiability does not suffice for our purpose, due to the existence of multiple zeros and as such we extend it to uniform Newton differentiability. In this context, we can show that the distance between the iterates and the set of zeros of the system decreases super-linearly. For the special case of smooth equations, the assumptions of our algorithm are simplified. Finally, we provide some numerical examples to showcase the behavior of our proposed method. The key example is a toy model of complementarity constraint problems, showing that our method has great application potential across engineering fields. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_17864 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Newton-type Method for Non-smooth Under-determined Systems of Equations Pinta, Titus Optimization and Control We study a variant of Newton's algorithm applied to under-determined systems of non-smooth equations. The notion of regularity employed in our work is based on Newton differentiability, which generalizes semi-smoothness. The classic notion of Newton differentiability does not suffice for our purpose, due to the existence of multiple zeros and as such we extend it to uniform Newton differentiability. In this context, we can show that the distance between the iterates and the set of zeros of the system decreases super-linearly. For the special case of smooth equations, the assumptions of our algorithm are simplified. Finally, we provide some numerical examples to showcase the behavior of our proposed method. The key example is a toy model of complementarity constraint problems, showing that our method has great application potential across engineering fields. |
| title | A Newton-type Method for Non-smooth Under-determined Systems of Equations |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2504.17864 |