Proposes an overlapping graph decomposition SQP method for gsNLPs achieving global convergence and local linear rate that improves exponentially with overlap size, validated on PDE problems.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Parallel Sequential Quadratic Programming with Overlapping Graph Decomposition and Exact Augmented Lagrangian
Proposes an overlapping graph decomposition SQP method for gsNLPs achieving global convergence and local linear rate that improves exponentially with overlap size, validated on PDE problems.