Nonlinear Schwarz preconditioning for nonlinear optimization problems with bound constraints
Not on the map. Why?
Abstract (arXiv)
We propose a nonlinear additive Schwarz method for solving nonlinear optimization problems with bound constraints. Our method is used as a "right-preconditioner" for solving the first-order optimality system arising within the sequential quadratic programming (SQP) framework using Newton's method. The algorithmic scalability of this preconditioner is enhanced by incorporating a solution-dependent coarse space, which takes into account the restricted constraints from the fine level. By means of numerical examples, we demonstrate that the proposed preconditioned Newton methods outperform standard active-set methods considered in the literature.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 27 Nov 2022.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 1.
3 papers.
- 2023Enhancing training of physics-informed neural networks using domain-decomposition based preconditioning strategiescited by 20
- 2024Two-level overlapping additive Schwarz preconditioner for training scientific machine learning applicationscited by 5
- 2025Recursive Bound-Constrained AdaGrad with Applications to Multilevel and Domain Decomposition Minimizationcited by 3
- 2025Recursive Bound-Constrained AdaGrad with Applications to Multilevel and Domain Decomposition Minimization15 Jul 2025
- 2024Two-level overlapping additive Schwarz preconditioner for training scientific machine learning applications16 Jun 2024
- 2023Enhancing training of physics-informed neural networks using domain-decomposition based preconditioning strategies30 Jun 2023