A strongly convergent primal–dual method for nonoverlapping domain decomposition
- 10 July 2015
- journal article
- Published by Springer Nature in Numerische Mathematik
- Vol. 133 (3) , 443-470
Abstract
No abstract availableKeywords
All Related Versions
This publication has 26 references indexed in Scilit:
- On the global regularity for nonlinear systems of the $p$-Laplacian typeDiscrete and Continuous Dynamical Systems - S, 2013
- Alternating proximal algorithms for linearly constrained variational inequalities: Application to domain decomposition for PDE’sNonlinear Analysis, 2011
- A splitting algorithm for dual monotone inclusions involving cocoercive operatorsAdvances in Computational Mathematics, 2011
- A Monotone+Skew Splitting Model for Composite Monotone Inclusions in DualitySIAM Journal on Optimization, 2011
- Subspace Correction Methods for Total Variation and $\ell_1$-MinimizationSIAM Journal on Numerical Analysis, 2009
- Domain decomposition algorithmsActa Numerica, 1994
- A Remark on the Regularity of the Solutions of the p-Laplacian and Its Application to Their Finite Element ApproximationJournal of Mathematical Analysis and Applications, 1993
- Boundary regularity for solutions of degenerate elliptic equationsNonlinear Analysis, 1988
- Regularity for a more general class of quasilinear elliptic equationsJournal of Differential Equations, 1984
- Variational inequalities with varying obstacles: The general form of the limit problemJournal of Functional Analysis, 1983